{
  "id": "1605.00773",
  "version": "v1",
  "published": "2016-05-03T07:50:28.000Z",
  "updated": "2016-05-03T07:50:28.000Z",
  "title": "On the Hamiltonicity of triple systems with high minimum degree",
  "authors": [
    "Vojtěch Rödl",
    "Andrzej Ruciński",
    "Mathias Schacht",
    "Endre Szemerédi"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We show that every 3-uniform hypergraph with minimum vertex degree at least $0.8\\binom{n-1}{2}$ contains a tight Hamiltonian cycle.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-05-03T07:50:28.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C65",
      "05C45"
    ],
    "keywords": [
      "high minimum degree",
      "triple systems",
      "hamiltonicity",
      "minimum vertex degree",
      "tight hamiltonian cycle"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}