Covering a graph by forests and a matching

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.