The Cameron–Erdős Conjecture

@article{Green2003TheCC,
  title={The Cameron–Erdős Conjecture},
  author={B. Green},
  journal={Bulletin of The London Mathematical Society},
  year={2003},
  volume={36},
  pages={769-778}
}
  • B. Green
  • Published 2003
  • Mathematics
  • Bulletin of The London Mathematical Society
A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)). 
View PDF on arXiv
57 Citations
Highly Influential Citations
13
Background Citations
18
Methods Citations
9
Results Citations
7

57 Citations

Citation Type

Citation Type

Solution of the Cameron-Erdös problem for groups of prime order
  • 6
The Cameron-Erdös conjecture
  • 36
Estimates of the Cameron–Erdős constants
Large sum-free sets in ℤ/pℤ
  • 12
Groups with few maximal sum-free sets
  • 1
  • Highly Influenced
  • PDF
Asymptotics of the logarithm of the number of (k, l)-sum-free sets in an Abelian group
  • 1
A sharp bound on the number of maximal sum-free sets
  • 2
  • Highly Influenced
  • PDF
Bounds on the Number of Maximal Sum-Free Sets
  • Guy Wolfovitz
  • Mathematics, Computer Science
  • Electron. Notes Discret. Math.
  • 2007
  • 5
  • PDF
The number of maximal sum-free subsets of integers
  • 16
  • Highly Influenced
  • PDF
On the number of sets with a given doubling constant
  • 1
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-3 OF 3 REFERENCES
Counting Sets of Integers, Nokof Which Sum to Another
  • 16
  • PDF
Sum-free sets in abelian groups
  • 30
On the structure and the number of sum-free sets
  • 15
  • PDF