The genus of a random graph (Q1896342)
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: The genus of a random graph |
scientific article; zbMATH DE number 790747
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The genus of a random graph |
scientific article; zbMATH DE number 790747 |
Statements
The genus of a random graph (English)
0 references
8 April 1996
0 references
The minimum number of handles (crosscaps) needed to embed a graph on an orientable (nonorientable) surface is shown to be close to \(pn^2/12\) \((pn^2/6)\) for almost every random graph of order \(n\) with edge probability \(p\).
0 references
genus
0 references
embeddings
0 references
triangulations
0 references
surface
0 references
random graph
0 references
0 references
0 references
0 references
0.92527395
0 references
0.92527395
0 references
0.9178895
0 references
0.91658133
0 references
