Expected number of faces in a random embedding of any graph is at most linear (Q6085874)
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 7762895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Expected number of faces in a random embedding of any graph is at most linear |
scientific article; zbMATH DE number 7762895 |
Statements
Expected number of faces in a random embedding of any graph is at most linear (English)
0 references
8 November 2023
0 references
random embeddings
0 references
average genus
0 references
random topological graph theory
0 references
0.8849822282791138
0 references
0.7964853644371033
0 references
0.7605350613594055
0 references
0.7587571740150452
0 references
0.7573592662811279
0 references
