3-Connected Cores In Random Planar Graphs

DOI10.1017/S0963548310000532MaRDI QIDQ2998851zbMATH OpenOpenAlexFDO

Authors Nikolaos Fountoulakis, Konstantinos Panagiotou

Publication date 11 May 2011

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0907.2326

zbMATH Keywords

labelled biconnected graphslarge random planar graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10)

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 biconnected planar graphs regarding the sizes of their 3-connected building blocks, which we call cores. In fact, we prove a general theorem regarding random biconnected graphs. If B_n is a graph drawn uniformly at random from a class B of labeled biconnected graphs, then we show that with probability 1-o(1) B_n belongs to exactly one of the following categories: (i) Either there is a unique giant core in B_n, that is, there is a 0 < c < 1 such that the largest core contains ~ cn vertices, and every other core contains at most n^a vertices, where 0 < a < 1; (ii) or all cores of B_n contain O(log n) vertices. Moreover, we find the critical condition that determines the category to which B_n belongs, and also provide sharp concentration results for the counts of cores of all sizes between 1 and n. As a corollary, we obtain that a random biconnected planar graph belongs to category (i), where in particular c = 0.765... and a = 2/3.

Recommendations

• The generalized 3-connectivity of random graphs
• On the frequency of 3-connected subgraphs of planar graphs
• Random planar maps and graphs with minimum degree two and three
• On 3^*-connected graphs
• Graph classes with given 3-connected components: asymptotic enumeration and random graphs
• (3,3)-linked planar graphs
• On 3-simplicial vertices in planar graphs
• On the density of non-simple 3-planar graphs
• On random planar graphs, the number of planar graphs and their triangulations
• Random cubic planar graphs revisited

Cites work

• Asymptotic enumeration and limit laws of planar graphs
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Counting labelled three-connected and homeomorphically irreducible two- connected graphs
• Random Trees
• Random planar graphs

Cited in

(10)

• Random graphs from a weighted minor-closed class
• Blocks in constrained random graphs with fixed average degree
• Random graphs from a block-stable class
• Phase transitions in graphs on orientable surfaces
• Connectivity for Bridge-addable monotone graph classes
• Graph classes with given 3-connected components: asymptotic enumeration and random graphs
• Maximal biconnected subgraphs of random planar graphs
• Concentration of maximum degree in random planar graphs
• The maximum degree of random planar graphs
• Maximal biconnected subgraphs of random planar graphs

This page was built for publication: 3-Connected Cores In Random Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2998851)