Skip to main content
×
Home
    • Aa
    • Aa

3-Connected Cores In Random Planar Graphs

  • NIKOLAOS FOUNTOULAKIS (a1) and KONSTANTINOS PANAGIOTOU (a1)
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 call cores. In fact, we prove a general theorem regarding random biconnected graphs from various classes. If Bn is a graph drawn uniformly at random from a suitable class of labelled biconnected graphs, then we show that with probability 1 − o(1) as n → ∞, Bn belongs to exactly one of the following categories: (i)

either there is a unique giant core in Bn, that is, there is a 0 < c = c() < 1 such that the largest core contains ~ cn vertices, and every other core contains at most nα vertices, where 0 < α = α() < 1;

(ii)

or all cores of Bn contain O(logn) vertices.

Moreover, we find the critical condition that determines the category to which Bn 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 α = 2/3.

Copyright
References
Hide All
[5] M. Drmota (2009) Random Trees: An Interplay between Combinatorics and Probability, Springer.

[7] F. Flajolet and R. Sedgewick (2009) Analytic Combinatorics, Cambridge University Press.

[11] S. Janson , T. Łuczak and A. Ruciński (2000) Random Graphs, Wiley.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 8 *
Loading metrics...

Abstract views

Total abstract views: 71 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 26th September 2017. This data will be updated every 24 hours.