{
  "id": "1706.09029",
  "version": "v1",
  "published": "2017-06-27T19:59:10.000Z",
  "updated": "2017-06-27T19:59:10.000Z",
  "title": "Hamiltonian cycles in 3-tough $2K_2$-free graphs",
  "authors": [
    "Songling Shan"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "A graph is called $2K_2$-free if it does not contain two independent edges as an induced subgraph. Broersma, Patel, and Pyatkin showed that every 25-tough $2K_2$-free graph with at least three vertices is hamiltonian. In this paper, we improve the required toughness in this result from 25 to 3.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-06-27T19:59:10.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "free graph",
      "hamiltonian cycles",
      "independent edges",
      "induced subgraph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}