Let H be a tree on h greater than or equal to 2 vertices. It is shown
that if G = (V,E) is a graph with delta(G) greater than or equal to (\
V\/2) + 10h(4) root\V\log\V\, and h - 1 divides \E\, then there is a d
ecomposition of the edges of G into copies of H. This result is asympt
otically the best possible for all trees with at least three vertices.
(C) 1998 John Wiley & Sons, Inc.