In combinatorial mathematics, the Cameron–Erdős conjecture is the statement that the number of sum-free sets contained in <math>\{1,\ldots,N\}</math> is <math>O\left({2^{N/2}}\right)</math>. The conjecture was stated by Peter Cameron and Paul Erdős in 1988[1]. It was proved by Ben Green in 2003[2] [3].
See also
References
- ^ P.J. Cameron and P. Erdős, On the number of sets of integers with various properties, Number theory (Banff, 1988), de Gruyter, Berlin 1990, pp.61-79
- ^ B. Green, The Cameron-Erdős conjecture, 2003.
- ^ B. Green, The Cameron-Erdős conjecture, Bulletin of the London Mathematical Society 36 (2004) pp.769-778
