Counting colored random triangulations

DOI10.1016/S0550-3213(02)00582-5zbMATH Open0998.05019arXivcond-mat/0206452OpenAlexW3101300090MaRDI QIDQ699557FDOQ699557

Authors: Bouttier, Philippe Di Francesco, Emmanuel Guitter 

Publication date: 24 September 2002

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

Abstract: We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to the enumeration of decorated trees. We give a direct combinatorial derivation of the associated counting function, involving tricolored trees. This is generalized to arbitrary k-gonal tessellations with cyclic colorings and checked by use of matrix models.

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

Recommendations

• Coloring random triangulations
• Counting colored planar maps: algebraicity results
• Counting planar maps, coloured or uncoloured
• Counting coloured planar maps: differential equations
• Rectangular matrix models and combinatorics of colored graphs

zbMATH Keywords

decorated tree enumerationplanar graph counting

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• Counting patterns in colored orthogonal arrays
• Multicritical continuous random trees
• Counting gluings of octahedra
• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• A generalization of the Virasoro algebra to arbitrary dimensions
• Geodesic distance in planar graphs
• Chromatic statistics for triangulations and Fuß-Catalan complexes
• Critical behavior of colored tensor models in the large \(N\) limit
• On the number of planar Eulerian orientations
• Geodesic distance in planar graphs: an integrable approach
• Orthogonal matrix Laurent polynomials
• Statistics of planar graphs viewed from a vertex: A study via labeled trees
• Symmetries of unlabelled planar triangulations
• Rectangular matrix models and combinatorics of colored graphs
• Colored triangulations of arbitrary dimensions are stuffed Walsh maps
• Counting colored planar maps: algebraicity results

This page was built for publication: Counting colored random triangulations

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