The Nine Dragon Tree Conjecture for bounded forest decompositions

Let $G$ be a graph, and let $k,d$ be nonnegative integers. The Nine Dragon Tree Conjecture. If

$$\gamma_f(G)\leq k+\frac{d}{d+k+1},$$

then $G$ decomposes into $k+1$ forests, one of which is $d$-bounded. The conjecture is the graph-theoretic Nine Dragon Tree statement concerning decomposition into forests with one bounded component. It was proved by Jiang and Yang, so the conjecture is resolved.