Abstract
This paper proves that for any positive integer n, if m is large enough, then the reduced Kneser graph KG 2( m, n) has its circular chromatic number equal its chromatic number. This answers a question of Lih and Liu (J. Graph Theory 41 (2002) 62). For Kneser graphs, we prove that if m⩾2 n 2( n−1), then KG( m, n) has its circular chromatic number equal its chromatic number. This provides strong support for a conjecture of Johnson, Holroyd, and Stahl (J. Graph Theory 26 (1997) 137).
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.
