Abstract
Abstract Amit, Linial, and Matousek (Random lifts of graphs III: independence and chromatic number, Random Struct. Algorithms, 2002) have raised the following question: Is the chromatic number of random h-lifts of K 5 asymptotically (for h → ∞ ) almost surely (a.a.s.) equal to a single number? In this paper, we offer the following partial result: The chromatic number of a random lift of K 5 e is a.a.s. three. We actually prove a stronger statement where K 5 e can be replaced by a graph obtained from joining a cycle to a stable set.
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.
