Tree packing conjecture for families of trees

Let $n\in\mathbb{N}$, and let $(T_s)_{s\in[n]}$ be a family of trees such that $v(T_s)=s$ for every $s\in[n]$. Tree packing conjecture. The family $(T_s)_{s\in[n]}$ packs into the complete graph $K_n$. The paper presents this as one of the central tree-packing conjectures and later proves it for sufficiently large $n$ when the trees have maximum degree $O(n/\log n)$; the general case with large-degree vertices remains open.