{
  "id": "1107.2201",
  "version": "v1",
  "published": "2011-07-12T07:18:55.000Z",
  "updated": "2011-07-12T07:18:55.000Z",
  "title": "A Size Bound for Hamilton Cycles",
  "authors": [
    "Zh. G. Nikoghosyan"
  ],
  "comment": "3 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "Every graph of size $q$ (the number of edges) and minimum degree $\\delta$ is hamiltonian if $q\\le\\delta^2+\\delta-1$. The result is sharp.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-07-12T07:18:55.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hamilton cycles",
      "size bound",
      "minimum degree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 3,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1107.2201N"
    }
  }
}