Abstract
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 language | English (US) |
|---|---|
| Pages (from-to) | 313-341 |
| Number of pages | 29 |
| Journal | Nuclear Physics B |
| Volume | 655 |
| Issue number | 3 |
| DOIs | |
| State | Published - Apr 14 2003 |
| Externally published | Yes |
ASJC Scopus subject areas
- Nuclear and High Energy Physics