Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal. Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. pages 1177-1193, SIAM, 2024. [doi]
@inproceedings{LothHMMS24,
title = {Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic},
author = {Jesse Campion Loth and Kevin Halasz and Tomás Masarík and Bojan Mohar and Robert Sámal},
year = {2024},
doi = {10.1137/1.9781611977912.46},
url = {https://doi.org/10.1137/1.9781611977912.46},
researchr = {https://researchr.org/publication/LothHMMS24},
cites = {0},
citedby = {0},
pages = {1177-1193},
booktitle = {Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024},
editor = {David P. Woodruff},
publisher = {SIAM},
isbn = {978-1-61197-791-2},
}