{
  "id": "1007.0316",
  "version": "v2",
  "published": "2010-07-02T08:20:51.000Z",
  "updated": "2010-12-14T21:30:08.000Z",
  "title": "Covering a graph by forests and a matching",
  "authors": [
    "Tomas Kaiser",
    "Mickael Montassier",
    "Andre Raspaud"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2010-12-14T21:30:08.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "fractional arboricity",
      "positive integer"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1007.0316K"
    }
  }
}