{
  "id": "1402.4603",
  "version": "v1",
  "published": "2014-02-19T09:40:02.000Z",
  "updated": "2014-02-19T09:40:02.000Z",
  "title": "Resolvable 3-star designs",
  "authors": [
    "Selda Kucukcifci",
    "Giovanni Lo faro",
    "Salvatore Milici",
    "Antoinette Tripodi"
  ],
  "comment": "arXiv admin note: text overlap with arXiv:1310.7403",
  "categories": [
    "math.CO"
  ],
  "abstract": "Let Kv be the complete graph of order v and F be a set of 1-factors of Kv. In this article we study the existence of a resolvable decomposition of Kv - F into 3-stars when F has the minimum number of 1-factors. We completely solve the case in which F has the minimum number of 1- factors, with the possible exception of v in {40, 44, 52, 76, 92, 100, 280, 284, 328, 332, 428, 472, 476, 572}.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-02-19T09:40:02.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05B05"
    ],
    "keywords": [
      "minimum number",
      "complete graph",
      "resolvable decomposition"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1402.4603K"
    }
  }
}