Sharp concentration of the number of submaps in random planar triangulations

DOI10.1007/S00493-003-0028-XzbMATH1066.05076OpenAlexW2064317094MaRDI QIDQ558223FDOQ558223

Authors Zhicheng Gao, Nicholas Wormald

Publication date 5 July 2005

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-003-0028-x

zbMATH Keywords

random graphsplanar maps

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Recommendations

• The distribution of the maximum vertex degree in random planar maps
• Concentration of maximum degree in random planar graphs
• A central limit theorem for the number of degree-\(k\) vertices in random maps
• The maximum degree of random planar graphs
• On random planar graphs, the number of planar graphs and their triangulations

Cited in

(8)

• The number of double triangles in random planar maps
• On properties of random dissections and triangulations
• Asymptotic normality determined by high moments, and submap counts of random maps
• The distribution of the number of small cuts in a random planar triangulation
• A central limit theorem for the number of degree-\(k\) vertices in random maps
• Random stable laminations of the disk
• Submap Density and Asymmetry Results for Two Parameter Map Families
• Distributions of near-4-regular maps on the sphere and the projective plane

This page was built for publication: Sharp concentration of the number of submaps in random planar triangulations

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