KAIST Discrete Math Seminar

Let f(n,r) denote the maximum number of colourings of A⊆{1,…,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^⌈n/2⌉, and describe the extremal subsets. Further, using linear optimisation, we asymptotically determine the logarithm of f(n,r) for r≤5.
Joint work with Maryam Sharifzadeh and Katherine Staden.