Embedding trees into graphs of large girth (Q1567289)

It is shown that for all except a finite number of pairs \((t,k)\) the following conjecture of Dobson holds: A tree \(T\) with \(k\) vertices can always be embedded into a graph of minimum degree \(\max\{\Delta(T), \lceil (k-1)/t \rceil \}\) and girth at least \(2t+1.\)