Abstract
A minor-closed class of graphs is addable if each excluded minor is 2-connected. We see that such a classof labelled graphs has smooth growth; and, for the random graphRnsampled uniformly from then-vertex graphs in, the fragment not in the giant component asymptotically has a simple ‘Boltzmann Poisson distribution’. In particular, asn→ ∞ the probability thatRnis connected tends to 1/A(ρ), whereA(x) is the exponential generating function forand ρ is its radius of convergence.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference31 articles.
1. Enumeration and limit laws for series–parallel graphs
2. Random planar graphs
3. [18] Kurauskas V. and McDiarmid C. (2008) Random graphs without disjoint cycles. In preparation.
4. Connectivity of addable graph classes
5. [7] Bodirsky M. , Giménez O. , Kang M. and Noy M. (2005) On the number of series-parallel and outerplanar graphs. In Proc. European Conference on Combinatorics, Graph Theory, and Applications (EuroComb 2005), Discrete Math. Theor. Comput. Sci. Proc., Vol. AE, pp. 383–388.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献