The Anti-Ramsey Problem for the Sidon equation

Vladislav Taranchuk, Craig Timmons

For $n\ge k\ge 4$, let $A{R}_{X+Y=Z+T}^k(n)$ be the maximum number of rainbow solutions to the Sidon equation $X+Y=Z+T$ over all $k$-colorings $c:[n]\to [k]$.…