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

Source: [Exact Solution of the Three-color Problem on a Random Lattice](<https://www.sota2.com/research/paper/68fa25182c2a3760193aca27>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-24T10:08:11.312Z

Authors: Ivan K. Kostov

Published: 2000-05-20T16:18:17.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/hep-th/0005190>)

[PDF](<https://arxiv.org/pdf/hep-th/0005190.pdf>)
