The Cameron-Erdos Conjecture

2003/04/04 by Ben Green, Green, Ben
Mathematics · #11B75 #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #math.CO #math.NT #msc:11B75

paper · pdf · doi:10.48550/arxiv.math/0304058

11 pages, to appear in Bull. London Math. Soc

arxiv created 2003/04/04 · arxiv updated 2009/11/30

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)).

Related

• On the number of sum-free subsets of the square grid
• Sum-free Sets of Integers with a Forbidden Sum
• Large sum-free subsets of sets of integers via L¹-estimates for trigonometric series
• Sharp bound on the number of maximal sum-free subsets of integers
• The number of maximal sum-free subsets of integers