Circular chromatic number of Kneser graphs

@article{Hajiabolhassan2003CircularCN,
  title={Circular chromatic number of Kneser graphs},
  author={Hossein Hajiabolhassan and Xuding Zhu},
  journal={J. Comb. Theory, Ser. B},
  year={2003},
  volume={88},
  pages={299-303}
}
This paper proves that for any positive integer n, if m is large enough, then the reduced Kneser graph KG2(m, n) has its circular chromatic number equal its chromatic number. This answers a question of Lih and Liu [J. Graph Theory, 2002]. For Kneser graphs, we prove that if m ≥ 2n2(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-145]. Suppose m ≥ 2n are… CONTINUE READING

From This Paper

Topics from this paper.
18 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Aufgabe 300

  • M. Kneser
  • Jber. Deutsch. Math.-Verein. 58
  • 1955
Highly Influential
8 Excerpts

Vertex-critical subgraphs of Kneser graphs

  • A. Schrijver
  • Nieuw Arch. Wiskd., III. Ser. 26
  • 1978
1 Excerpt

Some intersection theorems for systems of finite sets

  • A. J. W. Hilton, E. C. Milner
  • Quart . J . Math . Oxford
  • 1967

Similar Papers

Loading similar papers…