{
  "id": "2009.03119",
  "version": "v1",
  "published": "2020-09-07T14:09:01.000Z",
  "updated": "2020-09-07T14:09:01.000Z",
  "title": "Monochromatic connected matchings in almost complete graphs",
  "authors": [
    "Shoham Letzter"
  ],
  "comment": "11 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "A connected matching in a graph $G$ is a matching that is contained in a connected component of $G$. A well-known method due to {\\L}uczak reduces problems about monochromatic paths and cycles in complete graphs to problems about monochromatic matchings in almost complete graphs. We show that these can be further reduced to problems about monochromatic connected matchings in complete graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-09-07T14:09:01.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "complete graphs",
      "monochromatic connected matchings",
      "monochromatic matchings",
      "monochromatic paths"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}