On the number of sum-free subsets of the square grid

Abstract

Generalising the Cameron--Erdős conjecture to two dimensions, Elsholtz and Rackham conjectured that the number of sum-free subsets of $[n{]}^2$ is $2^{0.6n^2+O(n)}$. We prove their conjecture.