{
  "id": "1609.01675",
  "version": "v1",
  "published": "2016-09-06T17:56:34.000Z",
  "updated": "2016-09-06T17:56:34.000Z",
  "title": "Decompositions of complete uniform multi-hypergraphs into Berge paths and cycles of arbitrary lengths",
  "authors": [
    "Ramin Javadi",
    "Afsaneh Khodadadpour",
    "Gholamreza Omidi"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "In 1981, Alspach conjectured that the complete graph $ K_{n} $ could be decomposed into cycles of arbitrary lengths, provided that the obvious necessary conditions would hold. This conjecture was proved completely by Bryant, Horsley and Pettersson in 2014. Moreover, in 1983, Tarsi conjectured that the obvious necessary conditions for packing pairwise edge-disjoint paths of arbitrary lengths in the complete multigraphs were also sufficient. The conjecture was confirmed by Bryant in 2010. In this paper, we investigate an analogous problem as the decomposition of the complete uniform multi-hypergraph $ \\mu K_{n}^{(k)} $ into Berge cycles and Berge paths of arbitrary given lengths. We show that for every integer $ \\mu\\geq 1 $, $ n\\geq 108 $ and $ 3\\leq k<n $, $ \\mu K_{n}^{(k)} $ can be decomposed into Berge cycles and Berge paths of arbitrary lengths, provided that the obvious necessary conditions hold, thereby generalizing a result by K\\\"{u}hn and Osthus on the decomposition of $K_{n}^{(k)}$ into Hamilton Berge cycles. Furthermore, we obtain the necessary and sufficient conditions for packing the cycles of arbitrary lengths in the complete multigraphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-09-06T17:56:34.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C38",
      "05C70",
      "05C65"
    ],
    "keywords": [
      "arbitrary lengths",
      "complete uniform multi-hypergraph",
      "berge paths",
      "decomposition",
      "complete multigraphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}