Counting Colored Random Triangulations
arXiv:cond-mat/0206452 · doi:10.1016/S0550-3213(02)00582-5
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.
17 pages, 8 figures, tex, harvmac, epsf
Cited by in corpus (11)
- Critical behavior of colored tensor models in the large N limit
- Colored Tensor Models - a Review
- Geodesic Distance in Planar Graphs
- A generalization of the Virasoro algebra to arbitrary dimensions
- Census of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof
- Statistics of planar graphs viewed from a vertex: A study via labeled trees
- Random trees between two walls: Exact partition function
- Geometrically constrained statistical systems on regular and random lattices: From folding to meanders
- Combinatorics of bicubic maps with hard particles
- On the number of planar Eulerian orientations
- Multicritical continuous random trees