Exact solution of the three-color problem on a random lattice

DOI10.1016/S0370-2693(02)02887-3zbMath1001.05057arXivhep-th/0005190WikidataQ62048397 ScholiaQ62048397MaRDI QIDQ1848261

Ivan K. Kostov

Publication date: 19 November 2002

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

Full work available at URL: https://arxiv.org/abs/hep-th/0005190

zbMATH Keywords

random planar graphBaxter three-color problemcoupled random matrices

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (algebraic aspects) (15B52) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Critical behaviour of spanning forests on random planar graphs

Cites Work

• Unnamed Item
• An iterative solution of the three-colour problem on a random lattice
• D-particles, matrix integrals and KP hierarchy.
• Planar diagrams
• Quantum field theory and the coloring problem of graphs
• Exact solution of the six-vertex model on a random lattice.

This page was built for publication: Exact solution of the three-color problem on a random lattice