Almost every tree with n edges decomposes K2n,2n

Let T be a tree with m edges. We show that if T has at least (m+1)/3 leaves then T decomposes the complete bipartite graph K2n,2n. In particular this shows that almost all trees decompose K2n,2n, a result connected to a conjecture of Graham and Häggkvist.