Lower bounds on the chromatic number of random graphs

arXiv: Combinatorics, Volume abs/1812.09691, 2018.

Cited by: 0|Bibtex|Views6|Links
EI

Abstract:

We prove that a formula predicted on the basis of non-rigorous physics arguments [Zdeborova 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 the lower bound can be express...More

Code:

Data:

Your rating :
0

 

Tags
Comments