Exact Solution of the Three-color Problem on a Random Lattice

Details Exact Solution of the Three-color Problem on a Random Lattice Exact Solution of the Three-color Problem on a Random Lattice

2000-05-20

arxiv.org/abs/hep-th/0005190v2

Phys.Lett. B549 (2002) 245-252

Physics

High Energy Physics

High Energy Physics - Theory

9 pages, 2 figures

Scientific paper

10.1016/S0370-2693(02)02887-3

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.

Affiliated with

Also associated with

No associations

Rating

Exact Solution of the Three-color Problem on a Random Lattice does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact Solution of the Three-color Problem on a Random Lattice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Solution of the Three-color Problem on a Random Lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-258827