arXiv · cond-mat/0409448
How many colors to color a random graph? Cavity, Complexity, Stability and all that
Abstract
We review recent progress on the statiscal physics study of the problem of coloring random graphs with q colors. We discuss the existence of a threeshold at connectivity c_q=2q log q-log q-1+o(1) separting two phases which are respectivily COL(orable) and UNCOL(orable) with q colors; We also argue that the so-called one-step replica symmetry breaking ansatz used to derive these results give it exact threshold values, and draw a general phase diagram of the problem.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Florent Krzakala. 2004-11-01. How many colors to color a random graph? Cavity, Complexity, Stability and all that. https://doi.org/10.1143/ptps.157.357. https://searcharxiv.com/abs/cond-mat/0409448
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.