On the maximum number of integer colourings with forbidden monochromatic sums (Q2662340): Difference between revisions

Summary: 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 \(\lbrace x,y,z\rbrace\) 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 \le 5\). Similar results were obtained by \textit{H. Hàn} and \textit{A. Jiménez} [Isr. J. Math. 226, No. 2, 505--534 (2018; Zbl 1402.05210)] in the setting of finite abelian groups.