{
  "id": "1508.00645",
  "version": "v1",
  "published": "2015-08-04T02:41:15.000Z",
  "updated": "2015-08-04T02:41:15.000Z",
  "title": "Decompositions of complete multigraphs into cycles of varying lengths",
  "authors": [
    "Darryn Bryant",
    "Daniel Horsley",
    "Barbara Maenhaut",
    "Benjamin R. Smith"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-08-04T02:41:15.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C51",
      "05B30",
      "05C38"
    ],
    "keywords": [
      "complete multigraph",
      "varying lengths",
      "decomposition",
      "edge-disjoint cycles"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150800645B"
    }
  }
}