Spanning Trees in Dense Graphs

Endre Szemeredi
Rutgers University

Let G be a graph on n vertices, with minimum degree n/2+Kmlogn, for some constant K. We prove that G contains any spanning tree of maximum degree m. This is a joint work with Bela Csaba and Asif Jamshed.

Back to Workshop III: Topics in Graphs and Hypergraphs