2 problems

Strong Nine Dragon Tree Conjecture
Strong Nine Dragon Tree Conjecture. If
openFrom papersforests fractional-arboricity graph-decompositions
0 responses
6
Fractional arboricity bounded-diameter conjecture
Fractional arboricity bounded-diameter conjecture. There exists $d(k,\varepsilon)$ such that, if
openFrom papersdiameter-bounded-graphs fractional-arboricity graph-decompositions
0 responses
4

Strong Nine Dragon Tree Conjecture