Combinatorics of Hard Particles on Planar Graphs

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.

35 pages, 20 figures, tex, harvmac, epsf

References in corpus (1)

• Census of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof

Cited by in corpus (6)

• Geodesic Distance in Planar Graphs
• The three-point function of planar quadrangulations
• Blocked edges on Eulerian maps and mobiles: Application to spanning trees, hard particles and the Ising model
• Combinatorics of bicubic maps with hard particles
• Confluence of geodesic paths and separating loops in large planar quadrangulations
• Multicritical continuous random trees