Limit laws of planar maps with prescribed vertex degrees
From MaRDI portal
Publication:5219325
DOI10.1017/S0963548318000573zbMath1434.05010arXiv1808.05944MaRDI QIDQ5219325
Gwendal Collet, Michael Drmota, Lukas Daniel Klausner
Publication date: 11 March 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.05944
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16) Vertex degrees (05C07)
Related Items (3)
Concentration of maximum degree in random planar graphs ⋮ Pattern occurrences in random planar maps ⋮ Counting embeddings of rooted trees into families of rooted trees
Cites Work
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- A bijection for rooted maps on general surfaces
- A complete grammar for decomposing a family of graphs into 3-connected components
- Radius and profile of random planar maps with faces of arbitrary degrees
- The asymptotic number of rooted maps on a surface
- Planar maps as labeled mobiles
- Random Trees
- Asymptotic Enumeration of Constellations and Related Families of Maps on Orientable Surfaces
- A Bijection for Rooted Maps on Orientable Surfaces
- A bijection for nonorientable general maps
- Formulae and Asymptotics for Coefficients of Algebraic Functions
- A Census of Planar Maps
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Limit laws of planar maps with prescribed vertex degrees