Maryam Sharifzadeh

On the maximum number of integer colourings with forbidden monochromatic sums

Let $f(n,r)$ denote the maximum number of colourings of $A \subseteq \{1,\ldots,n\}$ with $r$ colours such that each colour class is sum-free.
Here, a sum is a subset $\{x,y,z\}$ such that $x+y=z$. We show that $f(n,2) = 2^{\lceil n/2\rceil}$, and describe the extremal subsets. Further, using linear optimisation, we asymptotically determine the logarithm of $f(n,r)$ for $r \leq 5$.
This is joint work with Hong Liu and Katherine Staden.