Edge colorings of graphs without monochromatic stars
classification
🧮 math.CO
keywords
coloringsedgemonochromaticresultswithoutadmitapplicationcopies
read the original 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 $n$ vertices may admit. Our results rely on an improved application of an entropy inequality of Shearer.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.