Speaker : | Dr. Kyle F. Jao (Engineer of Yahoo! Inc.) |
---|---|
Title : | Circular Chromatic Ramsey Number |
Time : | 2014-02-21 (Fri) 14:00 - 15:30 |
Place : | Seminar Room 617, Institute of Mathematics (NTU Campus) |
Abstract: | We introduce the as the infimum of the circular chromatic numbers of graphs such that every red/blue edge-coloring of yields a red copy of a graph in or a blue copy of a graph in . We prove and . Also, if and each contain a graph with circular chromatic number at most (such as any odd cycle of length at least ), then . Furthermore, no graph has circular chromatic Ramsey number between and . Joint work with Claude Tardif, Douglas West, and Xuding Zhu. |