{
  "id": "2010.08592",
  "version": "v1",
  "published": "2020-10-16T19:05:48.000Z",
  "updated": "2020-10-16T19:05:48.000Z",
  "title": "The threshold for the square of a Hamilton cycle",
  "authors": [
    "Jeff Kahn",
    "Bhargav Narayanan",
    "Jinyoung Park"
  ],
  "comment": "6 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "Resolving a conjecture of K\\\"uhn and Osthus from 2012, we show that $p= 1/\\sqrt{n}$ is the threshold for the random graph $G_{n,p}$ to contain the square of a Hamilton cycle.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-10-16T19:05:48.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80"
    ],
    "keywords": [
      "hamilton cycle",
      "random graph",
      "conjecture"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}