Embedding trees into graphs of large girth

Dobson conjectured that for every t and k a tree with k vertices can always be embedded into a graph of minimum degree max{Δ(T),⌈(k−1)/t⌉} and girth at least 2t+1. We show that the conjecture holds for all except a finite number of pairs (t,k).