Edge colorings of graphs without monochromatic stars
arXiv:1903.04541 · doi:10.1016/j.disc.2020.112140
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.
14 pages