Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Jesse Campion Loth, Kevin Halasz, Tomás Masařík, Bojan Mohar, Robert Šámal

Journal title: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Journal number: 35

Journal publisher: Society for Industrial and Applied Mathematics

Published year: 2024

Published pages: 1177-1193

DOI identifier: 10.1137/1.9781611977912.46

ISBN: 978-1-61197-791-2