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

DOI10.1016/j.disc.2023.113685zbMath1525.05028MaRDI QIDQ6080141

Yi-Chao Chen, Zhi-Cheng Gao

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper boundembeddinglower boundaverage genusaverage number of faces

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds for the average genus of a CF-graph
• Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
• Permutation-partition pairs. III: Embedding distributions of linear families of graphs
• Limit points for average genus. II: 2-connected non-simplicial graphs
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• Maximum genus and connectivity
• A tight lower bound on the maximum genus of a simplicial graph
• On the average genus of a graph
• Maximum genus, connectivity, and Nebeský's Theorem
• An Introduction to Random Topological Graph Theory
• Lower bounds for the average genus
• On the average genus of the random graph
• Fast generation of cubic graphs
• Random 2-cell embeddings of multistars
• Genus polynomials and crosscap‐number polynomials for ring‐like graphs
• Expected number of faces in a random embedding of any graph is at most linear

This page was built for publication: New bounds for the average genus and average number of faces of a simple graph