The maximum degree of random planar graphs

DOI10.1112/plms/pdu024zbMath1303.05176MaRDI QIDQ2930131

Marc Noy, Angelika Steger, Omer Giménez, Michael Drmota, Konstantinos D. Panagiotou

Publication date: 18 November 2014

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/pdu024

zbMATH Keywords

Boltzmann sampling techniques; random labeled planar graph

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

05C10: Planar graphs; geometric and topological aspects of graph theory

05C07: Vertex degrees

Related Items

The Evolution of Random Graphs on Surfaces, On the Diameter of Random Planar Graphs, Random cubic planar graphs converge to the Brownian sphere, Maximum degree in minor-closed classes of graphs, Degree distribution in random planar graphs, Random graphs from a block-stable class, The evolution of random graphs on surfaces, The maximal degree in a Poisson-Delaunay graph, Concentration of maximum degree in random planar graphs, Local convergence of random planar graphs

Cites Work

• Degree distribution in random planar graphs
• On properties of random dissections and triangulations
• A complete grammar for decomposing a family of graphs into 3-connected components
• Random planar graphs
• The number of labeled 2-connected planar graphs
• The distribution of the maximum vertex degree in random planar maps
• Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
• Maximal biconnected subgraphs of random planar graphs
• 3-Connected Cores In Random Planar Graphs
• Uniform random sampling of planar graphs in linear time
• Vertices of given degree in series-parallel graphs
• Asymptotic enumeration and limit laws of planar graphs
• Boltzmann Samplers, Pólya Theory, and Cycle Pointing
• Singularity Analysis of Generating Functions
• Random Trees
• On the Maximum Degree of a Random Planar Graph
• The Degree Sequence of Random Graphs from Subcritical Classes
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• The Maximum Degree of Series-Parallel Graphs
• The enumeration of c-nets via quadrangulations
• Asymptotic enumeration, global structure, and constrained evolution
• Unnamed Item
• Unnamed Item