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
Conformal field theory from automorphic forms on a quantum group
Dalimil Mazac
Anomaly effective actions for 4d N=1 superconformal field theories
Pantelis Panopoulos, Ioannis Papadimitriou
Exact Splitting of Amplitudes and One-Loop Integrands: A Classical Origin of Zeros
Yang Li, Laurentiu Rodina, Zhi-Zhen Wang
5-brane webs and generalised symmetries
Mohammad Akhond, Federico Carta, Sung-Soo Kim et al.
Form Factors in AdS from the Worldsheet
Luis F. Alday, Clément Virally, Xinan Zhou
Higher Integrability, Generalized Symmetries, and Partially Topological Field Theories
Luigi Alfonsi, Leron Borsten, Mehran Jalali Farahani et al.