Combinatorics of hard particles on planar graphs

DOI10.1016/S0550-3213(03)00058-0zbMath1009.82005arXivcond-mat/0211168MaRDI QIDQ1864766

Jérémie Bouttier, Emmanuel Guitter, Philippe Di Francesco

Publication date: 19 March 2003

Published in: Nuclear Physics. B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0211168

zbMATH Keywords

two-matrix modeldecorated treesrandom tetravalent graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (9)

A bijection for triangulations of a polygon with interior points and multiple edges ⋮ Geodesic distance in planar graphs ⋮ Liouville quantum gravity and KPZ ⋮ Confluence of geodesic paths and separating loops in large planar quadrangulations ⋮ Polynomial equations with one catalytic variable, algebraic series and map enumeration ⋮ The enumeration of planar graphs via Wick's theorem ⋮ Multicritical continuous random trees ⋮ The three-point function of planar quadrangulations ⋮ Geodesic distance in planar graphs: an integrable approach

Cites Work

• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• Eigenvalue distribution of large random matrices, from one matrix to several coupled matrices
• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• Enumeration of planar constellations
• Planar diagrams
• A bijection for triangulations of a polygon with interior points and multiple edges
• A Census of Planar Triangulations
• A Census of Hamiltonian Polygons
• A Census of Slicings
• Critical and tricritical hard objects on bicolourable random lattices: exact solutions
• A Census of Planar Maps

This page was built for publication: Combinatorics of hard particles on planar graphs