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

Jesse Campion Loth, Kevin Halasz, Toms Masark, Bojan Mohar, Robert Smal

Browse the full SODA paper archive.