{
  "id": "1910.06385",
  "version": "v1",
  "published": "2019-10-14T19:06:35.000Z",
  "updated": "2019-10-14T19:06:35.000Z",
  "title": "Decomposition of tripartite graphs into 5-cycles; A review and some more results",
  "authors": [
    "Bahareh Kudarzi",
    "E. S. Mahmoodian",
    "Zahra Naghdabadi"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The problem of decomposing a complete tripartite graph into 5-cycles was first proposed in 1995 by Mahmoodian and Mirzakhani and since then many attempts have been made to decompose such graphs into 5-cycles. Such attempts were partially successful but parts of the problem still remain open. In this paper we review previous works and present some new results.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-10-14T19:06:35.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "decomposition",
      "complete tripartite graph",
      "remain open",
      "mahmoodian",
      "mirzakhani"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}