论文信息 - A short proof for Chen's Alternative Kneser Coloring Lemma - 字舞流文

A short proof for Chen's Alternative Kneser Coloring Lemma

We give a short proof for Chen@?s Alternative Kneser Coloring Lemma. This leads to a short proof for the Johnson-Holroyd-Stahl conjecture that Kneser graphs have their circular chromatic numbers equal to their chromatic numbers.

Xuding Zhu | Daphne Der-Fen Liu | Gerard J. Chang

[1] Hossein Hajiabolhassan,et al. Graph Powers and Graph Homomorphisms , 2010, Electron. J. Comb..

[2] Xuding Zhu,et al. Circular chromatic number: a survey , 2001, Discret. Math..

[3] László Lovász,et al. Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory, Ser. A.

[4] K. Fan. A Generalization of Tucker's Combinatorial Lemma with Topological Applications , 1952 .

[5] Gábor Tardos,et al. Local Chromatic Number, KY Fan's Theorem, And Circular Colorings , 2006, Comb..

[6] Xuding Zhu,et al. Circular chromatic number of Kneser graphs , 2003, J. Comb. Theory, Ser. B.

[7] Peng-An Chen,et al. A new coloring theorem of Kneser graphs , 2011, J. Comb. Theory, Ser. A.

[8] S. Stahl,et al. Multichromatic numbers, star chromatic numbers and Kneser graphs , 1997 .

[9] Frédéric Meunier. A topological lower bound for the circular chromatic number of Schrijver graphs , 2005 .