Speaker : Professor Peng-An Chen (National Taitung University)
Title : A new coloring theorem of Kneser graphs
Time : 2011-02-11 (Fri) 14:30 - 15:30
Place : Seminar Room 714, Institute of Mathematics (NTU Campus)
Abstract: In 1997, Johnson, Holroyd and Stahl conjectured that the circular chromatic number of the Kneser graphs KG(n,k) is equal to the chromatic number of these graphs. This was proved by Simonyi and Tardos (2006) and independently by Meunier (2005), if χ(KG(n,k)) is even. In this paper, we propose an alternative version of Kneser's coloring theorem to confirm the Johnson-Holroyd-Stahl conjecture.