Seminar series
Date
Tue, 04 Nov 2014
Time
14:30 -
15:30
Location
L6
Speaker
Alex Scott
Organisation
University of Oxford
Gyárfás conjectured in 1985 that if $G$ is a graph with no induced cycle of odd length at least 5, then the chromatic number of $G$ is bounded by a function of its clique number. We prove this conjecture. Joint work with Paul Seymour.