Seminar on Combinatorics

主講者: 陳鵬安教授 (國立台東大學)
講題: A new coloring theorem of Kneser graphs
時間: 2011-02-11 (Fri.)  14:30 - 15:30
地點: 數學所 714 研討室 (台大院區)
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.
  || Close window ||