Expected number of faces in a random embedding of any graph is at most linear

DOI10.1017/s096354832300010xzbMath1526.05036arXiv2202.07746OpenAlexW4366829792MaRDI QIDQ6085874

Bojan Mohar, Jesse Campion Loth

Publication date: 8 November 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.07746

zbMATH Keywords

average genusrandom embeddingsrandom topological graph theory

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

New bounds for the average genus and average number of faces of a simple graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound for the average number of regions
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• Two enumerative results on cycles of permutations
• An Introduction to Random Topological Graph Theory
• On the average genus of the random graph
• Random 2-cell embeddings of multistars

This page was built for publication: Expected number of faces in a random embedding of any graph is at most linear