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

Date: Thursday 8th November, 2.00 in Fine Hall 224
 
Speaker: Endre Szemeredi (Rutgers)

Title: On the Erdos-Sos conjecture.

We are going to prove that if k is large enough then a graph with average
degree k contains all trees on k vertices.

This is joint work with Miklos Ajtai, Janos Komlos and Miklos Simonovits.

                       -----------

Next week: Bruce Reed 

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