The maximum degree of random planar graphs
From MaRDI portal
Publication:2930131
DOI10.1112/plms/pdu024zbMath1303.05176OpenAlexW1999514338MaRDI 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, Proceedings of the London Mathematical Society. Third Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/pdu024
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)
Related Items (10)
Maximum degree in minor-closed classes of graphs ⋮ Concentration of maximum degree in random planar graphs ⋮ The evolution of random graphs on surfaces ⋮ Random cubic planar graphs converge to the Brownian sphere ⋮ On the Diameter of Random Planar Graphs ⋮ Local convergence of random planar graphs ⋮ The Evolution of Random Graphs on Surfaces ⋮ Degree distribution in random planar graphs ⋮ Random graphs from a block-stable class ⋮ The maximal degree in a Poisson-Delaunay graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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
This page was built for publication: The maximum degree of random planar graphs