{
  "id": "2001.03124",
  "version": "v1",
  "published": "2020-01-09T17:34:55.000Z",
  "updated": "2020-01-09T17:34:55.000Z",
  "title": "Cops and robbers on $2K_2$-free graphs",
  "authors": [
    "Jérémie Turcotte"
  ],
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We prove that the cop number of any $2K_2$-free graph is at most 2, which was previously conjectured by Sivaraman and Testa.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-01-09T17:34:55.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C57",
      "05C75",
      "05C38",
      "91A43"
    ],
    "keywords": [
      "free graph",
      "cop number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}