A Refinement of the Cameron-erdős Conjecture


In this paper we study sum-free subsets of the set {1, . . . , n}, that is, subsets of the first n positive integers which contain no solution to the equation x+ y = z. Cameron and Erdős conjectured in 1990 that the number of such sets is O(2). This conjecture was confirmed by Green and, independently, by Sapozhenko. Here we prove a refined version of their… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics