Sets avoiding a rainbow solution to the generalized Schur equation

Ervin Győri, Zhen He, Zequn Lv +4

A classical result in combinatorial number theory states that the largest subset of $[n]$ avoiding a solution to the equation $x+y=z$ is of size $\lceil n/2\rceil$. For all intege…