Asymptotic enumeration of labelled graphs by genus (Q625375)

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\).