Seminar series
Date
Tue, 03 May 2011
Time
14:30 -
15:30
Location
L3
Speaker
Bruce Reed
Organisation
McGill
In 1961 Hajos conjectured that if a graph contains no subdivsion of a clique of order t then its chromatic number is less than t. In 1981, Erdos and Fajtlowicz showed that the conjecture is almost always false. We show it is almost always true. This is joint work with Keevash, Mohar, and McDiarmid.