Abstract
A Kneser graph KGn,k is a graph whose vertices are in one-to-one correspondence with k-element subsets of [n], with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lovász states that the chromatic number of a Kneser graph KGn,k is equal to n−2k+2. In this paper we study the chromatic number of a random subgraph of a Kneser graph KGn,k as n grows. A random subgraph KGn,k(p) is obtained by including each edge of KGn,k with probability p. For a wide range of parameters k=k(n), p=p(n) we show that χ(KGn,k(p)) is very close to χ(KGn,k), w.h.p. differing by at most 4 in many cases. Moreover, we obtain the same bounds on the chromatic numbers for the so-called Schrijver graphs, which are known to be vertex-critical induced subgraphs of Kneser graphs.
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.
