1 problem

Let $G$ be a graph, and let $k,d$ be nonnegative integers. The Nine Dragon Tree Conjecture. If … then $G$ decomposes into $k+1$ forests, one of which is $d$-bounded. The conjecture…