{
  "id": "0907.3358",
  "version": "v2",
  "published": "2009-07-20T09:08:43.000Z",
  "updated": "2009-08-06T14:29:33.000Z",
  "title": "Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs",
  "authors": [
    "Luke Kelly"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We use a randomised embedding method to prove that for all \\alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \\delta^+(G),\\delta^-(G)\\geq (3/8+\\alpha)|G| contains every possible orientation of a Hamilton cycle. This confirms a conjecture of H\\\"aggkvist and Thomason.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2009-08-06T14:29:33.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C20",
      "05C38",
      "05C45",
      "05C35"
    ],
    "keywords": [
      "hamilton cycle",
      "arbitrary orientations",
      "sufficiently large oriented graph",
      "minimum in-degree",
      "randomised embedding method"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0907.3358K"
    }
  }
}