Covering a graph by forests and a matching
classification
🧮 math.CO
keywords
forestsgraphmatchingarboricitycoveringdecomposededgesfractional
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.