{
  "id": "0801.0394",
  "version": "v3",
  "published": "2008-01-02T14:22:05.000Z",
  "updated": "2008-04-10T19:45:04.000Z",
  "title": "An exact minimum degree condition for Hamilton cycles in oriented graphs",
  "authors": [
    "Peter Keevash",
    "Daniela Kühn",
    "Deryk Osthus"
  ],
  "comment": "revised version",
  "doi": "10.1112/jlms/jdn065",
  "categories": [
    "math.CO"
  ],
  "abstract": "We show that every sufficiently large oriented graph with minimum in- and outdegree at least (3n-4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thomassen from 1979.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2008-04-10T19:45:04.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C45",
      "05C20",
      "05C35"
    ],
    "keywords": [
      "exact minimum degree condition",
      "hamilton cycle",
      "sufficiently large oriented graph"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0801.0394K"
    }
  }
}