Paper detail

Circular chromatic number of induced subgraphs of Kneser graphs

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, Habolhassan and Zhu [Circular chromatic number of Kneser graphs, Journal of Combinatorial Theory Series B, 2003] proved that if $n$ is sufficiently large with respect to $k$, then the Schrijver graph ${\rm SG}(n,k)$ has the same chromatic and circular chromatic number. Later, Meunier [A topological lower bound for the circular chromatic number of Schrijver graphs, Journal of Graph Theory, 2005] and independently, Simonyi and Tardos [ Local chromatic number, Ky Fan's theorem and circular colorings, Combinatorica, 2006] proved that $χ({\rm SG}(n,k))=χ_c({\rm 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. Furthermore, as a generalization of Hajiabolhassan and Zhu's result, we prove that if $n$ is large enough with respect to $k$, then any sufficiently large induced subgraph of the Kneser graph ${\rm KG}(n,k)$ has the same chromatic number and circular chromatic number.