Tomas Kaiser, Mickael Montassier, Andre Raspaud
Published 2010-07-02, updated 2010-12-14Version 2
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.
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
Enumeration and asymptotics of restricted compositions having the same number of parts
A Note on Graph Pebbling
![QR code for arXiv:1007.0316 [math.CO]](http://oss.arxitics.com/images/favicon.svg)