Counting Colored Random Triangulations
Statistical Mechanics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.cond-mat/0206452,
title = {Counting Colored Random Triangulations},
author = {J. Bouttier and P. Di Francesco and E. Guitter},
journal= {arXiv preprint arXiv:cond-mat/0206452},
year = {2007}
}
Comments
17 pages, 8 figures, tex, harvmac, epsf