Counting colored random triangulations

DOI10.1016/S0550-3213(02)00582-5zbMath0998.05019arXivcond-mat/0206452OpenAlexW3101300090MaRDI QIDQ699557

Philippe Di Francesco, Emmanuel Guitter, Jérémie Bouttier

Publication date: 24 September 2002

Published in: Nuclear Physics. B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0206452

zbMATH Keywords

decorated tree enumerationplanar graph counting

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

On the number of planar Eulerian orientations ⋮ Geodesic distance in planar graphs ⋮ Symmetries of unlabelled planar triangulations ⋮ Statistics of planar graphs viewed from a vertex: A study via labeled trees ⋮ A generalization of the Virasoro algebra to arbitrary dimensions ⋮ Critical behavior of colored tensor models in the large \(N\) limit ⋮ Census of planar maps: From the one-matrix model solution to a combinatorial proof ⋮ Multicritical continuous random trees ⋮ Rectangular matrix models and combinatorics of colored graphs ⋮ Geodesic distance in planar graphs: an integrable approach

Cites Work

• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• Coloring random triangulations
• Enumeration of planar constellations
• Planar diagrams
• A Census of Planar Maps

This page was built for publication: Counting colored random triangulations