An upper bound for the average number of regions

DOI10.1016/0095-8956(91)90063-PzbMath0679.05028MaRDI QIDQ1124599

Saul Stahl

Publication date: 1991

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

upper boundmaximum genusaverage genusprobabilistic argumentorientable embeddingsarbitrary graphmean of the region distribution

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (9)

On the average genus of a graph ⋮ Bounds for the average genus of the vertex-amalgamation of graphs ⋮ Stratified graphs for imbedding systems ⋮ Random 2-cell embeddings of multistars ⋮ Cubic graphs whose average number of regions is small ⋮ Expected number of faces in a random embedding of any graph is at most linear ⋮ An Introduction to Random Topological Graph Theory ⋮ Remarks on the lower bounds for the average genus ⋮ On the number of maximum genus embeddings of almost all graphs

Cites Work

• Region distributions of some small diameter graphs
• Permutation-partition pairs. III: Embedding distributions of linear families of graphs
• Unnamed Item

This page was built for publication: An upper bound for the average number of regions