Why almost all k-colorable graphs are easy

• Authors: Amin Coja-Oghlan;Michael Krivelevich;Dan Vilenchik
• Venue: STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
• Year: 2007

Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the uniform distribution over k-colorable graphs with n vertices and exactly cn edges, c greater than some sufficiently large constant. We rigorously show that all proper k- colorings of most such graphs are clustered in one cluster, and agree on all but a small, though constant, number of vertices. We also describe a polynomial time algorithm that finds a proper k-coloring for (1 - o(1))- fraction of such random k-colorable graphs, thus asserting that most of them are "easy". This should be contrasted with the setting of very sparse random graphs (which are k-colorable whp), where experimental results show some regime of edge density to be difficult for many coloring heuristics. One explanation for this phenomena, backed up by partially non-rigorous analytical tools from statistical physics, is the complicated clustering of the solution space at that regime, unlike the more "regular" structure that denser graphs possess. Thus in some sense, our result rigorously supports this explanation.