2 problems

Matching

Strong Nine Dragon Tree Conjecture
At least 6 years old
Strong Nine Dragon Tree Conjecture. If
openforests fractional-arboricity graph-decompositions
010
Fractional arboricity bounded-diameter conjecture
About 10 years old
Fractional arboricity bounded-diameter conjecture. There exists $d(k,\varepsilon)$ such that, if
opendiameter-bounded-graphs fractional-arboricity graph-decompositions
010

Strong Nine Dragon Tree Conjecture