Abstract
AbstractThe clique‐chromatic number of a graph is the minimum number of colors required to assign to its vertex set so that no inclusion maximal clique is monochromatic. McDiarmid, Mitsche, and Prałat proved that the clique‐chromatic number of the binomial random graph is at most with high probability (whp). Alon and Krivelevich showed that it is greater than whp and suggested that the right constant in front of the logarithm is . We prove their conjecture and, beyond that, obtain a tight concentration result: whp .
Sign-in/Register to access full text options 
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.
