Counting colored random triangulations

J. Bouttier, P. Di Francesco, E. Guitter

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)519-532
Number of pages14
JournalNuclear Physics B
Issue number3
StatePublished - Oct 14 2002
Externally publishedYes

ASJC Scopus subject areas

  • Nuclear and High Energy Physics


Dive into the research topics of 'Counting colored random triangulations'. Together they form a unique fingerprint.

Cite this