Cameron–Erdős conjecture on sum-free subsets

Let [N]={1,,N}[N]=\{1,\dots,N\}. A subset AA of the integers is sum-free if there do not exist x,y,zAx,y,z\in A such that x+y=zx+y=z. Cameron–Erdős conjecture. The number of sum-free subsets of [N][N] is O(2N/2)O(2^{N/2}). This conjecture asks for the correct order of magnitude for the number of sum-free subsets of an initial interval of the positive integers. The paper states that the bound is proved, thereby confirming the conjecture.

Sources & referencesView supporting material

Primary source

Ben Green, “The Cameron-Erdos Conjecture”, arXiv:math/0304058 (2003).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.