Large Monochromatic Components of Small Diameter
Combinatorics
2021-09-13 v1
Abstract
Gy\'arf\'as conjectured in 2011 that every -edge-colored contains a monochromatic component of bounded ("perhaps three") diameter on at least vertices. Letzter proved this conjecture with diameter four. In this note we improve the result in the case of : We show that in every -edge-coloring of either there is a monochromatic component of diameter at most three on at least vertices or every color class is spanning and has diameter at most four.
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