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


Date: Friday 10th February, 3:00 in Fine Hall 224.
 
Speaker: Yan Wang (Georgia Tech)

Title: The Kelmans-Seymour conjecture

Seymour and, independently, Kelmans conjectured in the 1970s that every
5-connected nonplanar graph contains a subdivision of K_5. This
conjecture was proved by Ma and Yu for graphs containing K_4^-.
Recently, we proved the Kelmans-Seymour conjecture for all graphs. 
In this talk, I will give a sketch of our proof, and discuss related 
problems. This is joint work with Dawei He and Xingxing Yu.


                       -----------

Next week: Eli Berger

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