Abstract
For a set of positive integers A⊆[n], an r-coloring of A is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rainbow Erdős-Rothschild problem in the context of sum-free sets, which asks for the subsets of [n] with the maximum number of rainbow sum-free r-colorings. We show that for r=3, the interval [n] is optimal, while for r≥8, the set [⌊n/2⌋,n] is optimal. We also prove a stability theorem for r≥4. The proofs rely on the hypergraph container method, and some ad-hoc stability analysis.
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.
