Surveys in Combinatorics 2009: Counting planar graphs and related families of graphs

In this article we survey recent results on the asymptotic enumeration of planar graphs and, more generally, graphs embeddable in a fixed surface and graphs defined in terms of excluded minors. We also discuss in detail properties of random planar graphs, such as the number of edges, the degree distribution or the size of the largest k-connected component. Most of the results we present use generating functions and analytic tools.

[1]  Marc Noy,et al.  Random planar graphs and the number of planar graphs , 2006 .

[2]  Edward A. Bender,et al.  The asymptotic number of rooted maps on a surface , 1986, J. Comb. Theory, Ser. A.

[3]  G. Pólya,et al.  Combinatorial Enumeration Of Groups, Graphs, And Chemical Compounds , 1988 .

[4]  W. T. Tutte.  Connectivity in graphs , 1966 .

[5]  Philippe Chassaing,et al.  Random planar lattices and integrated superBrownian excursion , 2002, math/0205226.

[6]  W. T. Tutte,et al.  On the Enumeration of Rooted Non-Separable Planar Maps , 1964, Canadian Journal of Mathematics.

[7]  Konstantinos Panagiotou,et al.  On properties of random dissections and triangulations , 2008, SODA '08.

[8]  Frank Harary,et al.  Graphical enumeration , 1973 .

[9]  T. C. Hu,et al.  Combinatorial algorithms , 1982 .

[10]  Swastik Kopparty,et al.  TO PLANAR GRAPHS , 2010 .

[11]  R. Mullin,et al.  The enumeration of c-nets via quadrangulations , 1968 .

[12]  Paul Wollan,et al.  Proper minor-closed families are small , 2006, J. Comb. Theory B.

[13]  Nicholas C. Wormald,et al.  The Distribution of the Maximum Vertex Degree in Random Planar Maps , 2000, J. Comb. Theory A.

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

[15]  W. T. Tutte,et al.  A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.

[16]  Vincent Vatter.  Permutation classes of every growth rate (a.k.a. Stanley-Wilf limit) above 2.48187.. , 2008 .

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

[18]  Marc Noy,et al.  Enumeration and limit laws for series-parallel graphs , 2007, Eur. J. Comb..

[19]  Colin McDiarmid,et al.  Random graphs on surfaces , 2008, J. Comb. Theory, Ser. B.

[20]  Nicholas C. Wormald,et al.  Asymptotic normality determined by high moments, and submap counts of random maps , 2004 .

[21]  Gilbert Labelle,et al.  Combinatorial species and tree-like structures , 1997, Encyclopedia of mathematics and its applications.

[22]  N. Wormald,et al.  Models of the , 2010 .

[23]  György Turán,et al.  On the succinct representation of graphs , 1984, Discret. Appl. Math..

[24]  M. Bousquet-M'elou.  Rational and algebraic series in combinatorial enumeration , 2008, 0805.0588.

[25]  R. Otter.  The Number of Trees , 1948 .

[26]  Guy Louchard,et al.  Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.

[27]  J. Moon.  Counting labelled trees , 1970 .

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

[29]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[30]  Edward A. Bender,et al.  Submaps of maps. I. General 0-1 laws , 1992, J. Comb. Theory, Ser. B.

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

[32]  Marc Noy,et al.  Graph classes with given 3-connected components: asymptotic counting and critical phenomena , 2007, Electron. Notes Discret. Math..

[33]  Edward A. Bender,et al.  Coefficients of Functional Compositions Often Grow Smoothly , 2008, Electron. J. Comb..

[34]  R. Diestel.  Graph Decompositions: A Study in Infinite Graph Theory , 1990 .

[35]  Mihyun Kang,et al.  A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components , 2008, Electron. J. Comb..

[36]  Bruce A. Reed,et al.  On the Maximum Degree of a Random Planar Graph , 2008, Comb. Probab. Comput..

[37]  A. Zvonkin,et al.  Graphs on Surfaces and Their Applications , 2003 .

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

[39]  Deryk Osthus,et al.  On random planar graphs, the number of planar graphs and their triangulations , 2003, J. Comb. Theory, Ser. B.

[40]  Colin McDiarmid,et al.  On the Number of Edges in Random Planar Graphs , 2004, Combinatorics, Probability and Computing.

[41]  Martin Klazar.  On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects , 2008, Electron. J. Comb..

[42]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[43]  Eric Fusy,et al.  A linear approximate-size random sampler for labelled planar graphs , 2007 .

[44]  Robin Thomas,et al.  Hadwiger's conjecture forK6-free graphs , 1993, Comb..

[45]  Marc Noy,et al.  Degree distribution in random planar graphs , 2009, J. Comb. Theory, Ser. A.

[46]  Manuel Bodirsky,et al.  Generating Labeled Planar Graphs Uniformly at Random , 2003, ICALP.

[47]  Timothy R. S. Walsh,et al.  Counting labelled three-connected and homeomorphically irreducible two-connected graphs , 1982, J. Comb. Theory, Ser. B.

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

[49]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[50]  D. Welsh,et al.  On the growth rate of minor-closed classes of graphs , 2007, 0710.2995.

[51]  C. McDiarmid,et al.  RANDOM PLANAR GRAPHS WITH GIVEN AVERAGE DEGREE , 2007 .

[52]  Philippe Flajolet,et al.  A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[53]  Béla Bollobás,et al.  Random Graphs , 1985 .

[54]  Philippe Flajolet,et al.  Random maps, coalescing saddles, singularity analysis, and Airy phenomena , 2001, Random Struct. Algorithms.

[55]  Edward A. Bender,et al.  Largest 4-Connected Components of 3-Connected Planar Triangulations , 1995, Random Struct. Algorithms.

[56]  C. McDiarmid,et al.  Random Graphs from Planar and Other Addable Classes , 2006 .

[57]  Edward A. Bender,et al.  Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions , 1983, J. Comb. Theory, Ser. A.

[58]  Edward Allburn,et al.  Graph decomposition , 1990 .

[59]  Manuel Bodirsky,et al.  Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs , 2007, Electron. J. Comb..

[60]  Nicholas C. Wormald,et al.  The Size of the Largest Components in Random Planar Maps , 1999, SIAM J. Discret. Math..

[61]  M. Drmota.  Systems of functional equations , 1997 .

[62]  Marc Noy,et al.  Vertices of given degree in series‐parallel graphs , 2010, Random Struct. Algorithms.

[63]  Marc Noy,et al.  Vertices of given degree in series-parallel graphs , 2010 .

[64]  Valery A. Liskovets,et al.  A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps , 1999, J. Comb. Theory, Ser. B.