The Strong Nine Dragon Tree Conjecture is true for $d\le k+1$

Sebastian Mies, Benjamin Moore

The arboricity $\Gamma (G)$ of an undirected graph $G=(V,E)$ is the minimal number such that $E$ can be partitioned into $\Gamma (G)$ forests. Nash-Williams' formula states that $k = \lceil…