Abstract
We consider an extremal problem motivated by a question of Erdős and Rothschild and by a paper of Balogh, who considered edge-colorings of graphs avoiding fixed subgraphs with a prescribed coloring. Given r≥t≥2, we look for n-vertex graphs that admit the maximum number of r-edge-colorings such that at most t−1 colors appear in edges incident with each vertex. For large n, we show that, with the exception of the case t=2, the complete graph Kn is always the unique extremal graph. We also consider generalizations of this problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
