Exact Solution of the Three-color Problem on a Random Lattice
Ivan K. Kostov
Abstract
We present the exact solution of the Baxter's three-color problem on a random planar graph, using the random-matrix formulation of the problem, given by B. Eynard and C. Kristjansen. We find that the number of three-coloring of an infinite random graph is 0.9843 per vertex.
Create a lesson
Related papers
Environmental Effects in Post-Minkowskian Dynamics: Effective Field Theory, Feynman Rules, and Ward Identities for Compact Objects in Relativistic Fluids
Zvi Bern, Samuel Degen, Enrico Herrmann et al.
Toward a Unique Filter for the Gravitational Path Integral
Marc S. Klinger
Young Gerard storming high energy physics
John Iliopoulos
Exploring multi-parameter optimization in FRG
A. Codello, G. P. Vacca, D. Zarrilli
New Bethe vacua for N=2 elliptic models
Antonio Amariti, Pietro Glorioso, Chiara Mascherpa et al.
Holographic correlators with non-supersymmetric multi-particle states
Michele Giorgi, Stefano Giusto