 |
 |
Recent數據載入中... |
On the circular chromatic number of Kneser graphs
國立東華大學應用數學系
專 題 演 講
主講人：陳鵬安教授
國立台東大學數學系
講 題：On the circular chromatic number of Kneser graphs
時 間：99年11月17日(星期三)10:10-12:00
摘 要
In 1997, Johnson, Holroyd and Stahl conjectured that the circular chromatic number of the Kneser graphs is equal to the chromatic number of these graphs. Hajiabolhassan and Zhu (2003) proved that for any positive integer , if , then has its circular chromatic number equals its chromatic number. They provided strong support for the conjecture.
It was proved by Simonyi and Tardos (2006), and independently by Meunier (2005), if is even, then . Recently, we propose an alternative version of Kneser's coloring theorem to confirm the Johnson-Holroyd-Stahl conjecture.
上列演講地點於理學院A324會議室舉行
※※※ 歡 迎 參 加 ※※※se991117C
附件：
瀏覽數
|