*********************************** * Princeton Discrete Math Seminar * *********************************** Date: Thursday 24th September, 3:00 in Fine Hall 224. Speaker: Alex Scott (University of Oxford) Title: The chromatic number of graphs without long holes Andras Gyarfas conjectured in 1985 that for all k and t, every graph with sufficiently large chromatic number contains either a complete subgraph on k vertices or an induced cycle of length at least t. We prove this conjecture and discuss some related results. Joint work with Maria Chudnovsky and Paul Seymour. ----------- Next week: Eli Berger Anyone wishing to be added to or removed from this mailing list should contact Paul Seymour (pds@math.princeton.edu)