{
  "id": "1110.5669",
  "version": "v2",
  "published": "2011-10-25T21:30:24.000Z",
  "updated": "2012-10-03T12:59:56.000Z",
  "title": "Embedding cycles of given length in oriented graphs",
  "authors": [
    "Daniela Kühn",
    "Deryk Osthus",
    "Diana Piguet"
  ],
  "comment": "8 pages, 2 figures",
  "doi": "10.1016/j.ejc.2012.10.002",
  "categories": [
    "math.CO"
  ],
  "abstract": "Kelly, Kuehn and Osthus conjectured that for any l>3 and the smallest number k>2 that does not divide l, any large enough oriented graph G with minimum indegree and minimum outdegree at least \\lfloor |V(G)|/k\\rfloor +1 contains a directed cycle of length l. We prove this conjecture asymptotically for the case when l is large enough compared to k and k>6. The case when k<7 was already settled asymptotically by Kelly, Kuehn and Osthus.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2012-10-03T12:59:56.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05D99",
      "05C20"
    ],
    "keywords": [
      "oriented graph",
      "embedding cycles",
      "conjecture",
      "smallest number",
      "minimum outdegree"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 8,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1110.5669K"
    }
  }
}