Prefer a chat interface with context about you and your work?
Lower Bounds on the Chromatic Number of Random Graphs
We prove that a formula predicted on the basis of non-rigorous physics arguments [Zdeborová and Krzakala: Phys. Rev. E (2007)] provides a lower bound on the chromatic number of sparse random graphs. The proof is based on the interpolation method from mathematical physics. In the case of random regular graphs …