English

Large Monochromatic Components of Small Diameter

Combinatorics 2021-09-13 v1

Abstract

Gy\'arf\'as conjectured in 2011 that every rr-edge-colored KnK_n contains a monochromatic component of bounded ("perhaps three") diameter on at least n/(r1)n/(r-1) vertices. Letzter proved this conjecture with diameter four. In this note we improve the result in the case of r=3r=3: We show that in every 33-edge-coloring of KnK_n either there is a monochromatic component of diameter at most three on at least n/2n/2 vertices or every color class is spanning and has diameter at most four.

Keywords

Cite

@article{arxiv.2109.04900,
  title  = {Large Monochromatic Components of Small Diameter},
  author = {Erik Carlson and Ryan R. Martin and Bo Peng and Miklós Ruszinkó},
  journal= {arXiv preprint arXiv:2109.04900},
  year   = {2021}
}

Comments

4 pages; Published online at Journal of Graph Theory

R2 v1 2026-06-24T05:51:43.000Z