{
  "id": "1011.4476",
  "version": "v1",
  "published": "2010-11-19T17:20:39.000Z",
  "updated": "2010-11-19T17:20:39.000Z",
  "title": "A note on some embedding problems for oriented graphs",
  "authors": [
    "Andrew Treglown"
  ],
  "comment": "6 pages, 2 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "We conjecture that every oriented graph $G$ on $n$ vertices with $\\delta ^+ (G) , \\delta ^- (G) \\geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfect packings of transitive tournaments is also considered.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-11-19T17:20:39.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C20",
      "05C35",
      "05C45",
      "05C70"
    ],
    "keywords": [
      "oriented graph",
      "embedding problems",
      "conjectural bound",
      "ramsey numbers",
      "perfect packing"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1011.4476T"
    }
  }
}