Abstract
AbstractWe consider random graphs Gn,p with fixed edge‐probability p. We refine an argument of Bollobás to show that almost all such graphs have chromatic number equal to n/{2 logb n − 2 logb logb n + O(1)} where b = 1/(1 − p).
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.
