Claims

../

1988_12_01_alon_freiman: Alon and Freiman find an m for which the largest subset of the first n integers avoiding m as a subset sum has (1/2 + o(1)) n / log n elements, matching the Erdős-Graham lower bound; Combinatorica (1988), site-credited.

---