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


Date: Thursday 18th February, 3:00 in Fine Hall 224.
 
Speaker: Sophie Spirkl (Princeton)

Title: Coloring perfect graphs with bounded clique number


I will talk about optimally coloring Berge graphs (graphs with no odd
hole or antihole). The main difficulty with finding a combinatorial 
algorithm is handling decompositions by balanced skew partitions. 
I will show how to solve this in the case of bounded clique number. 

Joint with with Maria Chudnovsky, Aurelie Lagoutte and Paul Seymour. 

                       -----------

Next week: Doron Puder

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