Integer colorings with no rainbow 3-term arithmetic progression

From MaRDI portal
(Redirected from Publication:2138586)




Abstract: In this paper, we study the rainbow ErdH{o}s-Rothschild problem with respect to 3-term arithmetic progressions. We obtain the asymptotic number of r-colorings of [n] without rainbow 3-term arithmetic progressions, and we show that the typical colorings with this property are 2-colorings. We also prove that [n] attains the maximum number of rainbow 3-term arithmetic progression-free r-colorings among all subsets of [n]. Moreover, the exact number of rainbow 3-term arithmetic progression-free r-colorings of mathbbZp is obtained, where p is any prime and mathbbZp is the cyclic group of order p.



Cites work







This page was built for publication: Integer colorings with no rainbow 3-term arithmetic progression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138586)