Combinatorics of hard particles on planar graphs

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

Research output: Contribution to journalArticlepeer-review


We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in this purely combinatorial language.

Original languageEnglish (US)
Pages (from-to)313-341
Number of pages29
JournalNuclear Physics B
Issue number3
StatePublished - Apr 14 2003
Externally publishedYes

ASJC Scopus subject areas

  • Nuclear and High Energy Physics


Dive into the research topics of 'Combinatorics of hard particles on planar graphs'. Together they form a unique fingerprint.

Cite this