3 problems

Strong Nine Dragon Tree Conjecture. If

Let $k$ and $d$ be integers, and let $G$ be a graph with fractional arboricity at most … A decomposition into $k+1$ forests has the star-component property if the components of one…

Fractional arboricity bounded-diameter conjecture. There exists $d(k,\varepsilon)$ such that, if