{
  "id": "1806.04644",
  "version": "v1",
  "published": "2018-06-12T16:58:35.000Z",
  "updated": "2018-06-12T16:58:35.000Z",
  "title": "Resolution of the Oberwolfach problem",
  "authors": [
    "Stefan Glock",
    "Felix Joos",
    "Jaehoon Kim",
    "Daniela Kühn",
    "Deryk Osthus"
  ],
  "comment": "28 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of $K_{2n+1}$ into edge-disjoint copies of a given $2$-factor. We show that this can be achieved for all large $n$. We actually prove a significantly more general result, which allows for decompositions into more general types of factors. In particular, this also resolves the Hamilton-Waterloo problem for large $n$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-06-12T16:58:35.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "oberwolfach problem",
      "resolution",
      "general types",
      "general result"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 28,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}