Graph classes with given 3‐connected components: Asymptotic enumeration and random graphs

Consider a family of 3-connected graphs of moderate growth, and let be the class of graphs whose 3-connected components are graphs in . We present a general framework for analyzing such graphs classes based on singularity analysis of generating functions, which generalizes previously studied cases such as planar graphs and series-parallel graphs. We provide a general result for the asymptotic number of graphs in , based on the singularities of the exponential generating function associated to . We derive limit laws, which are either normal or Poisson, for several basic parameters, including the number of edges, number of blocks and number of components. For the size of the largest block we find a fundamental dichotomy: classes similar to planar graphs have almost surely a unique block of linear size, while classes similar to series-parallel graphs have only sublinear blocks. This dichotomy was already observed by Panagiotou and Steger [25], and we provide a finer description. For some classes under study both regimes occur, because of a critical phenomenon as the edge density in the class varies. Finally, we analyze the size of the largest 3-connected component in random planar graphs. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 42, 438–479, 2013

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

[2]  Edward A. Bender,et al.  The Number of Labeled 2-Connected Planar Graphs , 2002, Electron. J. Comb..

[3]  Michael Drmota,et al.  Asymptotic Study of Subcritical Graph Classes , 2010, SIAM J. Discret. Math..

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

[5]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

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

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

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

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

[10]  W. T. Tutte.  Graph Theory , 1984 .

[11]  Marc Noy,et al.  On the number of graphs not containing $K_{3,3}$ as a minor , 2008 .

[12]  Edward A. Bender,et al.  Asymptotic Enumeration of Labelled Graphs by Genus , 2011, Electron. J. Comb..

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

[14]  Konstantinos Panagiotou,et al.  The Degree Sequence of Random Graphs from Subcritical Classes† , 2009, Combinatorics, Probability and Computing.

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

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

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

[18]  Colin McDiarmid,et al.  Random Graphs from a Minor-Closed Class , 2009, Combinatorics, Probability and Computing.

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

[20]  P. Flajolet,et al.  Analytic Combinatorics: RANDOM STRUCTURES , 2009 .

[21]  Konstantinos Panagiotou,et al.  3-Connected Cores In Random Planar Graphs , 2011, Comb. Probab. Comput..

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

[23]  Marc Noy,et al.  Growth constants of minor-closed classes of graphs , 2010, J. Comb. Theory B.

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

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

[26]  Konstantinos Panagiotou,et al.  Maximal biconnected subgraphs of random planar graphs , 2009, TALG.

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

[28]  K. Panagiotou.  Blocks in Constrained Random Graphs with Fixed Average Degree , 2009 .

[29]  Gilbert Labelle,et al.  Two-connected graphs with prescribed three-connected components , 2007, Adv. Appl. Math..

[30]  Omer Giménez,et al.  The number of planar graphs and properties of random planar graphs , 2005 .

[31]  Guy Louchard,et al.  Inverse auctions: Injecting unique minima into random sets , 2009, TALG.

[32]  Paul D. Seymour,et al.  Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.

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

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

[35]  Marc Noy,et al.  The Number of Graphs Not Containing K3, 3 as a Minor , 2008, Electron. J. Comb..

[36]  J. L. Nolan.  Stable Distributions. Models for Heavy Tailed Data , 2001 .

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

[38]  Colin McDiarmid,et al.  Random cubic planar graphs , 2007, Random Struct. Algorithms.

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

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

[41]  Marc Noy,et al.  The Maximum Degree of Series-Parallel Graphs , 2011, Combinatorics, Probability and Computing.