The Size of the Largest Components in Random Planar Maps

DOI10.1137/S0895480195292053MaRDI QIDQ4255817zbMATH OpenFDO

Authors Zhicheng Gao, Nicholas Wormald

Publication date 27 June 1999

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480195292053

zbMATH Keywords

componentcubic mapsplanar mapstriangulations

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• Largest 4‐connected components of 3‐connected planar triangulations
• Random cubic planar maps
• Random planar maps and graphs with minimum degree two and three
• Maximal biconnected subgraphs of random planar graphs
• Random triangulations of the plane

Cited in

(17)

• Uniform infinite planar triangulations
• The evolution of random graphs on surfaces
• Joint convergence of random quadrangulations and their cores
• Counting compositions over finite abelian groups
• The distribution of the maximum vertex degree in random planar maps
• Size distribution of the largest component of a random \(a\)-mapping
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena
• Graph classes with given 3-connected components: asymptotic enumeration and random graphs
• scientific article; zbMATH DE number 3874387 (Why is no real title available?)
• The Evolution of Random Graphs on Surfaces
• A probabilistic approach to block sizes in random maps
• Largest 4‐connected components of 3‐connected planar triangulations
• Expected Maximum Block Size in Critical Random Graphs
• On the diameter of random planar graphs
• Random cubic planar graphs converge to the Brownian sphere
• Random cubic planar maps
• The uniform infinite cubic planar graph

This page was built for publication: The Size of the Largest Components in Random Planar Maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255817)