Asymptotic enumeration of labelled graphs with a given genus
Bender, E. A. · Gao, Z.
Original · EN
We enumerate rooted 2-connected and 3-connected surface maps with respect to vertices and edges. We also derive the bivariate version of the large face-width result for random 3-connected maps. These results are then used to derive asymptotic formulas for the number of labelled graphs of genus g (1-connected, 2-connected, and 3-connected graphs.)
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.