{
  "id": "1209.6149",
  "version": "v1",
  "published": "2012-09-27T07:45:33.000Z",
  "updated": "2012-09-27T07:45:33.000Z",
  "title": "A Note on Hamilton Cycles",
  "authors": [
    "Zh. G. Nikoghosyan"
  ],
  "comment": "2 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "If $G$ is a more than one tough graph on $n$ vertices with $\\delta\\ge \\frac{n}{2}-a$ for a given $a>0$ and $n$ is large enough then $G$ is hamiltonian.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-09-27T07:45:33.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hamilton cycles",
      "tough graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 2,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1209.6149N"
    }
  }
}