Minimum-degree generalization of the Tree Packing Conjecture

Let $T_2,\dots,T_k$ be trees, where $T_i$ has $i$ vertices, and let $\delta(G)$ denote the minimum degree of a graph $G$.

Minimum-degree tree-packing conjecture. If $G$ satisfies

$$\delta(G)\geq k-1,$$

then the set of trees $T_2,\dots,T_k$ has a packing into $G$.

This weakens the structural assumption of being $k$-chromatic to a minimum-degree condition. The paper proves a bounded-order result under this condition, while the unrestricted conjecture remains open.