The Cameron-Erdos Conjecture
arXiv:math/0304058
Abstract
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)).
11 pages, to appear in Bull. London Math. Soc