Strengthened Ringel packing conjecture for bounded tree orders

Let $n$ be a positive integer. Consider any family of trees in which every individual tree has order at most $n+1$ and the total number of edges is at most $\binom{2n+1}{2}$. Strengthened Ringel packing conjecture. The family packs into $K_{2n+1}$. This strengthens Ringel's conjecture by allowing a family of trees of possibly different orders while retaining the relevant order and edge bounds. The source labels this as a proposed strengthening; the supplied status evidence reports an asymptotic result only for a related bounded-maximum-degree conjecture, not a full proof.