The Size of the Largest Components in Random Planar Maps
From MaRDI portal
Publication:4255817
DOI10.1137/S0895480195292053zbMath0923.05030MaRDI QIDQ4255817
Zhi-Cheng Gao, Nicholas C. Wormald
Publication date: 27 June 1999
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
05C30: Enumeration in graph theory
Related Items
The Evolution of Random Graphs on Surfaces, A probabilistic approach to block sizes in random maps, 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, 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, Random maps, coalescing saddles, singularity analysis, and Airy phenomena, Graph classes with given 3-connected components: Asymptotic enumeration and random graphs