***********************************
                * Princeton Discrete Math Seminar *
                ***********************************


Date: Thursday 5th February, 3:00 in Fine Hall 224.
 
Speaker: Alex Scott (Oxford)

Title: Colouring graphs without odd holes

Gyarfas 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 present a proof of this conjecture,
in joint work with Paul Seymour.  We also discuss some further results, 
with Maria Chudnovsky and Paul Seymour.


                       -----------

Next week: Guangda Hu

Anyone wishing to be added to or removed from this mailing list should
contact Paul Seymour (pds@math.princeton.edu)