Covering a graph by forests and a matching - Mathematics > CombinatoricsReportar como inadecuado




Covering a graph by forests and a matching - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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.



Autor: Tomas Kaiser, Mickael Montassier, Andre Raspaud

Fuente: https://arxiv.org/







Documentos relacionados