Random planar maps and graphs with minimum degree two and three

zbMath1398.05112MaRDI QIDQ1991412

Lander Ramos, Marc Noy

Publication date: 30 October 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p5

zbMATH Keywords

random graphsplanar graphsasymptotic enumeration

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16) Vertex degrees (05C07)

Related Items

The mesoscopic geometry of sparse random maps

Cites Work

• Unnamed Item
• Unnamed Item
• Degree distribution in random planar graphs
• The enumeration of homeomorphically irreducible labelled graphs
• The number of labeled 2-connected planar graphs
• Connectivity for random graphs from a weighted bridge-addable class
• The distribution of the maximum vertex degree in random planar maps
• Enumeration and limit laws for series-parallel graphs
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena
• Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
• Uniform random sampling of planar graphs in linear time
• Asymptotic enumeration and limit laws of planar graphs
• Random cubic planar graphs
• Random Trees
• Random Graphs from a Minor-Closed Class
• The Maximum Degree of Series-Parallel Graphs
• The birth of the giant component
• On the probability of planarity of a random graph near the critical point
• A Census of Planar Maps

This page was built for publication: Random planar maps and graphs with minimum degree two and three