{
  "id": "1812.06386",
  "version": "v1",
  "published": "2018-12-16T04:23:16.000Z",
  "updated": "2018-12-16T04:23:16.000Z",
  "title": "Ramsey theory for highly connected monochromatic subgraphs",
  "authors": [
    "Jeffrey Bergfalk",
    "Michael Hrušák",
    "Saharon Shelah"
  ],
  "comment": "11 pages",
  "categories": [
    "math.LO"
  ],
  "abstract": "An infinite graph is highly connected if the complement of any subgraph of smaller size is connected. We consider weaker versions of Ramsey's Theorem asserting that in any coloring of the edges of a complete graph there exist large highly connected subgraphs all of whose edges are colored by the same color.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-12-16T04:23:16.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "03E02",
      "03E10"
    ],
    "keywords": [
      "highly connected monochromatic subgraphs",
      "ramsey theory",
      "infinite graph",
      "complete graph",
      "large highly connected subgraphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}