Exact Solution of the Three-color Problem on a Random Lattice
High Energy Physics - Theory
2009-10-31 v2 Statistical Mechanics
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.
Cite
@article{arxiv.hep-th/0005190,
title = {Exact Solution of the Three-color Problem on a Random Lattice},
author = {Ivan K. Kostov},
journal= {arXiv preprint arXiv:hep-th/0005190},
year = {2009}
}
Comments
9 pages, 2 figures