Abstract
In this paper we consider the classical Erdős–Rényi model of random graphs G n , p . We show that for p = p ( n ) ⩽ n − 3 / 4 − δ , for any fixed δ > 0 , the chromatic number χ ( G n , p ) is a.a.s. ℓ, ℓ + 1 , or ℓ + 2 , where ℓ is the maximum integer satisfying 2 ( ℓ − 1 ) log ( ℓ − 1 ) ⩽ p ( n − 1 ) .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
