37 citations · 50 across the 12 of their papers we have counts for
1 paper · 2 filters
Tomas Kaiser, Mickael Montassier, Andre Raspaud
We prove that for any positive integer k, the edges of any graph whose fractional arboricity is at most k+1/(3k+2) can be decomposed into k forests and a matching.