3-Connected Cores In Random Planar Graphs
Open Access
- 24 January 2011
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 20 (3) , 381-412
Abstract
The study of the structural properties of large random planar graphs has become in recent years a field of intense research in computer science and discrete mathematics. Nowadays, a random planar graph is an important and challenging model for evaluating methods that are developed to study properties of random graphs from classes with structural side constraints.In this paper we focus on the structure of random 2-connected planar graphs regarding the sizes of their 3-connected building blocks, which we callcores. In fact, we prove a general theorem regarding random biconnected graphs from various classes. IfBnis a graph drawn uniformly at random from a suitable class of labelled biconnected graphs, then we show that with probability 1 −o(1) asn→ ∞,Bnbelongs to exactly one of the following categories: (i)either there is a uniquegiantcore inBn, that is, there is a 0 <c=c( ) < 1 such that the largest core contains ~cnvertices, and every other core contains at mostnαvertices, where 0 < α = α( ) < 1; (ii)or all cores ofBncontainO(logn) vertices. Moreover, we find the critical condition that determines the category to whichBnbelongs, and also provide sharp concentration results for the counts of cores of all sizes between 1 andn. As a corollary, we obtain that a random biconnected planar graph belongs to category (i), where in particularc= 0.765. . . and α = 2/3.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Analytic Combinatorics2009
- Maximal Biconnected Subgraphs of Random Planar Graphs2009
- Random Trees2009
- Asymptotic enumeration and limit laws of planar graphsJournal of the American Mathematical Society, 2008
- The Number of Graphs Not Containing $K_{3,3}$ as a MinorThe Electronic Journal of Combinatorics, 2008
- Random planar graphsJournal of Combinatorial Theory, Series B, 2005
- Boltzmann Samplers for the Random Generation of Combinatorial StructuresCombinatorics, Probability and Computing, 2004
- Random Graphs2000
- Counting labelled three-connected and homeomorphically irreducible two-connected graphsJournal of Combinatorial Theory, Series B, 1982
- Connectivity in Graphs1966