Random embeddings of graphs: the expected number of faces in most graphs is logarithmic

DOI10.1137/1.9781611977912.46MaRDI QIDQ6645399

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

Publication date: 28 November 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Asymptotics of local face distributions and the face distribution of the complete graph

This page was built for publication: Random embeddings of graphs: the expected number of faces in most graphs is logarithmic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645399)