The Erdos-Moser sum-free set problem

Abstract

We show that if A is a finite set of integers then it has a subset S of size \log^{1+c} |A| (c>0 absolute) such that s+s' is never in A when s and s' are distinct elements of S.

47 pages. Corrections and clarifications

References in corpus (4)

• A Szemeredi-type regularity lemma in abelian groups, with applications
• Progression-free sets in Z_4^n are exponentially small
• On one problem of Gowers
• On sets of large exponential sums