On properties of random dissections and triangulations

DOI10.1007/s00493-010-2464-8zbMath1231.05235OpenAlexW1970541826MaRDI QIDQ653837

Nicla Bernasconi, Angelika Steger, Konstantinos D. Panagiotou

Publication date: 19 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/422592

zbMATH Keywords

triangulationsdissectionsrandom biconnected outerplanar graphsrandom convex polygons

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Vertex degrees (05C07) Polyhedral manifolds (52B70)

Related Items (9)

The CRT is the scaling limit of random dissections ⋮ Random non-crossing plane configurations: A conditioned Galton-Watson tree approach ⋮ The maximum degree of random planar graphs ⋮ The shape of random pattern-avoiding permutations ⋮ Limits of random tree-like discrete structures ⋮ Simply Generated Non-Crossing Partitions ⋮ Phase transitions in graphs on orientable surfaces ⋮ Random stable laminations of the disk ⋮ Extremal statistics on non-crossing configurations

Cites Work

• Unnamed Item
• Unnamed Item
• Sharp concentration of the number of submaps in random planar triangulations
• Analytic combinatorics of non-crossing configurations
• Asymptotic normality determined by high moments, and submap counts of random maps
• The distribution of the maximum vertex degree in random planar maps
• Boltzmann Samplers for the Random Generation of Combinatorial Structures

This page was built for publication: On properties of random dissections and triangulations