Tight bounds for embedding bounded degree trees

Abstract

Let T be a tree on n vertices with constant maximum degree K. Let G be a graph on n vertices having minimum degree δ(G) ≥ n/2 + CK log n, where CK is a constant. If n is sufficiently large then T ⊂ G. We also show that the bound on the minimum degree of G is tight.