{
  "id": "math/0612751",
  "version": "v1",
  "published": "2006-12-24T13:19:40.000Z",
  "updated": "2006-12-24T13:19:40.000Z",
  "title": "Hamilton cycles in highly connected and expanding graphs",
  "authors": [
    "Dan Hefetz",
    "Michael Krivelevich",
    "Tibor Szabo"
  ],
  "comment": "19 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper we prove a sufficient condition for the existence of a Hamilton cycle, which is applicable to a wide variety of graphs, including relatively sparse graphs. In contrast to previous criteria, ours is based on only two properties: one requiring expansion of ``small'' sets, the other ensuring the existence of an edge between any two disjoint ``large'' sets. We also discuss applications in positional games, random graphs and extremal graph theory.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2006-12-24T13:19:40.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C45",
      "05C38",
      "05C80"
    ],
    "keywords": [
      "hamilton cycle",
      "expanding graphs",
      "extremal graph theory",
      "wide variety"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 19,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math.....12751H"
    }
  }
}