{
  "id": "2001.00992",
  "version": "v1",
  "published": "2020-01-03T21:24:13.000Z",
  "updated": "2020-01-03T21:24:13.000Z",
  "title": "The Matching Number and Hamiltonicity of Graphs",
  "authors": [
    "Rao Li"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The matching number of a graph G is the size of a maximum matching in the graph. In this note, we present a sufficient condition involving the matching number for the Hamiltonicity of graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-01-03T21:24:13.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "matching number",
      "hamiltonicity"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}