Abstract
Investigating the equality of the chromatic number and the circular chromatic number of graphs has been an active stream of research for last decades. In this regard, Hajiabolhassan and Zhu in 2003 proved that if n is sufficiently large with respect to k , then the Schrijver graph SG( n , k ) has the same chromatic and circular chromatic number. Later, Meunier in 2005 and independently, Simonyi and Tardos in 2006 proved that χ (SG( n , k )) = χ c (SG( n , k )) if n is even. In this paper, we study the circular chromatic number of induced subgraphs of Kneser graphs. In this regard, we shall first generalize the preceding result to s -stable Kneser graphs for large even n and even s . Furthermore, as a generalization of the Hajiabolhassan-Zhu result, we prove that if n is large enough with respect to k , then any sufficiently large induced subgraph of the Kneser graph KG( n , k ) has the same chromatic number and circular chromatic number.
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.
