Exact solution of the three-color problem on a random lattice

DOI10.1016/S0370-2693(02)02887-3zbMATH Open1001.05057arXivhep-th/0005190WikidataQ62048397 ScholiaQ62048397MaRDI QIDQ1848261FDOQ1848261

Authors: Ivan K. Kostov 

Publication date: 19 November 2002

Published in: Physics Letters B (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/hep-th/0005190

zbMATH Keywords

random planar graphBaxter three-color problemcoupled random matrices

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (algebraic aspects) (15B52) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Planar diagrams
• D-particles, matrix integrals and KP hierarchy.
• Exact solution of the six-vertex model on a random lattice.
• Title not available (Why is that?)
• An iterative solution of the three-colour problem on a random lattice
• Quantum field theory and the coloring problem of graphs

Cited In (2)

• Three-coloring statistical model with domain wall boundary conditions: trigonometric limit
• Critical behaviour of spanning forests on random planar graphs

This page was built for publication: Exact solution of the three-color problem on a random lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1848261)