On the number of maximum genus embeddings of almost all graphs (Q1193548)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 64838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of maximum genus embeddings of almost all graphs |
scientific article; zbMATH DE number 64838 |
Statements
On the number of maximum genus embeddings of almost all graphs (English)
0 references
27 September 1992
0 references
By performing an induction in the context of permutation-partition pairs, the author obtains a lower bound for the number of orientable maximum genus labelled 2-cell imbeddings of almost all graphs. He shows that, although the bound is far from sharp, it is sufficiently strong to establish that for complete graphs triangulating an orientable surface the number of maximum genus imbeddings far exceeds the number of minimum genus imbeddings.
0 references
maximum genus embeddings
0 references
minimum genus imbeddings
0 references
0.853466808795929
0 references
0.823532223701477
0 references
0.8152059316635132
0 references
0.813810408115387
0 references
0.8106703162193298
0 references
