论文信息 - Enumeration of cubic multigraphs on orientable surfaces

Enumeration of cubic multigraphs on orientable surfaces

Abstract Let S g be the orientable surface of genus g. We show that the number of edge-labelled cubic multigraphs embeddable on S g with m = 3 k edges is asymptotically d g γ − m m 5 / 2 ( g − 1 ) − 1 m ! , where γ − 1 = 79 3 2 − 1 / 3 and c g is a constant only dependent on the genus.

Mihyun Kang | Philipp Sprüssel | Michael Moßhammer | W. Fang

[1] C. McDiarmid,et al. Random cubic planar graphs , 2007 .

[2] Zhi-Cheng Gao,et al. The number of rooted 2-connected triangular maps on the projective plane , 1991, J. Comb. Theory, Ser. B.

[3] Colin McDiarmid,et al. Random planar graphs , 2005, J. Comb. Theory B.

[4] Zhicheng Gao,et al. A Pattern for the Asymptotic Number of Rooted Maps on Surfaces , 1993, J. Comb. Theory, Ser. A.

[5] Tomasz Luczak,et al. Two critical periods in the evolution of random planar graphs , 2010, 1006.0444.

[6] W. T. Tutte. A Census of Planar Maps , 1963, Canadian Journal of Mathematics.

[7] Philippe Flajolet,et al. Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..

[8] Zhicheng Gao,et al. The asymptotic number of rooted 2-connected triangular maps on a surface , 1992, J. Comb. Theory, Ser. B.

[9] Omer Giménez,et al. Asymptotic enumeration and limit laws of planar graphs , 2005, math/0501269.

[10] Marc Noy,et al. Asymptotic enumeration and limit laws for graphs of fixed genus , 2010, J. Comb. Theory, Ser. A.

[11] Edward A. Bender,et al. The Asymptotic Number of Rooted Maps on a Surface. II. Enumeration by Vertices and Faces , 1993, J. Comb. Theory, Ser. A.