On the probability of planarity of a random graph near the critical point
From MaRDI portal
Publication:5496430
DOI10.1090/S0002-9939-2014-12141-1zbMath1306.05225arXiv1204.3376OpenAlexW2124547004MaRDI QIDQ5496430
Juanjo Rué, Marc Noy, Vlady Ravelomanana
Publication date: 2 February 2015
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.3376
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (10)
The genus of the Erd\H{o}s-R\'enyi random graph and the fragile genus property ⋮ Concentration of maximum degree in random planar graphs ⋮ The mesoscopic geometry of sparse random maps ⋮ Longest and shortest cycles in random planar graphs ⋮ Cubic graphs and related triangulations on orientable surfaces ⋮ Phase transitions in graphs on orientable surfaces ⋮ Random planar maps and graphs with minimum degree two and three ⋮ Cycles of given lengths in unicyclic components in sparse random graphs ⋮ Expected Maximum Block Size in Critical Random Graphs ⋮ Spanning trees in random series-parallel graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The first cycles in an evolving graph
- The number of graphs not containing \(K_{3,3}\) as a minor
- Airy phenomena and analytic combinatorics of connected graphs
- Asymptotic enumeration and limit laws for graphs of fixed genus
- The number of trees
- The scaling window of the 2-SAT transition
- Two critical periods in the evolution of random planar graphs
- Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
- The number of connected sparsely edged graphs. III. Asymptotic results
- Random cubic planar graphs
- The Evolution of Random Graphs
- The Structure of a Random Graph at the Point of the Phase Transition
- The birth of the giant component
This page was built for publication: On the probability of planarity of a random graph near the critical point