{
  "id": "2204.11360",
  "version": "v1",
  "published": "2022-04-24T21:20:50.000Z",
  "updated": "2022-04-24T21:20:50.000Z",
  "title": "Monochromatic components with many edges",
  "authors": [
    "David Conlon",
    "Sammy Luo",
    "Mykhaylo Tyomkyn"
  ],
  "comment": "12 pages, 4 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "Given an $r$-edge-coloring of the complete graph $K_n$, what is the largest number of edges in a monochromatic connected component? This natural question has only recently received the attention it deserves, with work by two disjoint subsets of the authors resolving it for the first two special cases, when $r = 2$ or $3$. Here we introduce a general framework for studying this problem and apply it to fully resolve the $r = 4$ case, showing that such a coloring always yields a monochromatic component with at least $\\frac{1}{12}\\binom{n}{2}$ edges, where the constant $\\frac{1}{12}$ is optimal only when the coloring matches a certain construction of Gy\\'arf\\'as.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-04-24T21:20:50.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C35",
      "05C40",
      "05C55"
    ],
    "keywords": [
      "monochromatic component",
      "monochromatic connected component",
      "natural question",
      "complete graph",
      "largest number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}