Edge colorings of graphs without monochromatic stars
Combinatorics
2020-09-11 v6
Abstract
In this note, we improve on results of Hoppen, Kohayakawa and Lefmann about the maximum number of edge colorings without monochromatic copies of a star of a fixed size that a graph on vertices may admit. Our results rely on an improved application of an entropy inequality of Shearer.
Cite
@article{arxiv.1903.04541,
title = {Edge colorings of graphs without monochromatic stars},
author = {Lucas Colucci and Ervin Győri and Abhishek Methuku},
journal= {arXiv preprint arXiv:1903.04541},
year = {2020}
}
Comments
14 pages