An upper bound for the average number of regions (Q1124599)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound for the average number of regions |
scientific article; zbMATH DE number 4112616
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the average number of regions |
scientific article; zbMATH DE number 4112616 |
Statements
An upper bound for the average number of regions (English)
0 references
1991
0 references
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.
0 references
orientable embeddings
0 references
probabilistic argument
0 references
upper bound
0 references
mean of the region distribution
0 references
arbitrary graph
0 references
average genus
0 references
maximum genus
0 references
0.8443672
0 references
0.8274218
0 references
0.8228931
0 references
0 references
0.8151145
0 references
