Lower Bounds on the Chromatic Number of Random Graphs
- 26 October 2021
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 42 (5) , 617-658
Abstract
No abstract availableKeywords
All Related Versions
This publication has 40 references indexed in Scilit:
- On the chromatic number of random d-regular graphsAdvances in Mathematics, 2010
- On the chromatic number of a random 5‐regular graphJournal of Graph Theory, 2009
- Phase transitions in the coloring of random graphsPhysical Review E, 2007
- The two possible values of the chromatic number of a random graphAnnals of Mathematics, 2005
- Bounds for diluted mean-fields spin glass modelsProbability Theory and Related Fields, 2004
- Almost all graphs with average degree 4 are 3-colorableJournal of Computer and System Sciences, 2003
- Random regular graphs of high degreeRandom Structures & Algorithms, 2001
- The concentration of the chromatic number of random graphsCombinatorica, 1997
- On the independence and chromatic numbers of random regular graphsJournal of Combinatorial Theory, Series B, 1992
- The chromatic number of random graphsCombinatorica, 1991