Covering a graph by forests and a matching - Mathematics > CombinatoricsReport as inadecuate




Covering a graph by forests and a matching - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: We prove that for any positive integer $k$, the edges of any graph whosefractional arboricity is at most $k + 1-3k+2$ can be decomposed into $k$forests and a matching.



Author: Tomas Kaiser, Mickael Montassier, Andre Raspaud

Source: https://arxiv.org/







Related documents