Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
From MaRDI portal
Publication:6506944
DOI10.1137/1.9781611977912.46arXiv2211.01032MaRDI QIDQ6506944
Jesse Campion Loth, Robert Šámal, Bojan Mohar, Tomáš Masařík, Kevin Halasz
This page was built for publication: Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic