A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Covering a Graph by Forests and a Matching
2011
SIAM Journal on Discrete Mathematics
Preserved Fulltext
We prove that for any positive integer k and for ε = 1/((k + 2)(3k 2 + 1)), the edges of any graph whose fractional arboricity is at most k + ε can be decomposed into k forests and a matching.
doi:10.1137/100818340
fatcat:y6qyimiu5bbhvcu3eljovvfyxm