On the Erdos-Sos conjecture

On the Erdos-Sos conjecture

-
Endre Szemeredi , Rutgers University
Fine Hall 224

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.