An upper bound for the average number of regions
type: Item
instance of: scholarly article
title: An upper bound for the average number of regions
zbMATH Open document ID: 0679.05028
DOI: 10.1016/0095-8956(91)90063-P
author: Saul Stahl
published in: Journal of Combinatorial Theory. Series B
publication date: 1991-01-01T00:00:00Z
review text: A probabilistic argument is used to obtain an upper bound on the mean of the region distribution of an arbitrary graph. This result, which is fairly sharp, though in all likelihood not best possible, is strong enough to imply that the average genus of the complete graph is asymptotic, in ratio, to its maximum genus.
reviewed by: Saul Stahl
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 4112616
zbMATH Keywords: orientable embeddings
zbMATH Keywords: probabilistic argument
zbMATH Keywords: upper bound
zbMATH Keywords: mean of the region distribution
zbMATH Keywords: arbitrary graph
zbMATH Keywords: average genus
zbMATH Keywords: maximum genus
MaRDI profile type: Publication
cites work: Q3757929
cites work: Permutation-partition pairs. III: Embedding distributions of linear families of graphs
cites work: Region distributions of some small diameter graphs
Recommended article: An upper bound on average touching number of a Voronoi partition
Recommended article: Q5883638
Recommended article: Q3639934
Recommended article: Counting regions with bounded surface area
Recommended article: Cubic graphs whose average number of regions is small
Recommended article: Berry-{E}sseen bounds for the number of maxima in planar regions
Recommended article: Q5184827
Recommended article: Q4933508
Recommended article: Region distributions of graph embeddings and Stirling numbers
Recommended article: Discrete Region Competition for Unknown Numbers of Connected Regions
description: scientific article; zbMATH DE number 4112616