Asymptotic enumeration of labelled graphs by genus (Q625375)
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: Asymptotic enumeration of labelled graphs by genus |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotic enumeration of labelled graphs by genus |
scientific article |
Statements
Asymptotic enumeration of labelled graphs by genus (English)
0 references
17 February 2011
0 references
Summary: We obtain asymptotic formulas for the number of rooted 2-connected and 3- connected surface maps on an orientable surface of genus \(g\) with respect to vertices and edges simultaneously. We also derive the bivariate version of the large facewidth result for random 3-connected maps. These results are then used to derive asymptotic formulas for the number of labelled \(k\)-connected graphs of orientable genus \(g\) for \(k \leq 3\).
0 references
asymptotic formula
0 references
surface map
0 references
orientable surface
0 references
face width
0 references
labelled graphs
0 references
orientable genus
0 references
