On packing trees into complete bipartite graphs

Let T2, …, T1 be a sequence of trees, where Ti has i vertices. We show that if t<0.79n, then the sequence can be packed into the complete bipartite graph Kn−1, n2(Kn,(n−1)/2), where n is even (odd). This significantly improves the result which appears in [2].