Colucci, LucasGyori, ErvinMethuku, Abhishek2020-11-012020-11-012020-11-012020-12-0110.1016/j.disc.2020.112140https://infoscience.epfl.ch/handle/20.500.14299/172918WOS:000579057200036In 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 n vertices may admit. Our results rely on an improved application of an entropy inequality of Shearer. (c) 2020 Elsevier B.V. All rights reserved.Mathematicserdos-rothschild problemedge-coloringmaximum numbertext::journal::journal article::research article