On graphs which contain each tree of given size Original Research Article

Dobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum degree no less than k/t and Δ(T), then G contains each tree T of size k. It is known that this conjecture holds for t = 1 and t = 2. We prove it in the case t = 3