The Cameron-Erdos Conjecture
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)).
主要作者: | Green, B |
---|---|
格式: | Journal article |
出版: |
2003
|
相似书籍
-
On a conjecture of Erdős
由: Chen, Yong-Gao, et al.
出版: (2022-09-01) -
Analytic Erdös-Turán conjectures and Erdös-Fuchs theorem
由: L. Haddad, et al.
出版: (2005-01-01) -
On an Erdős–Kac-type conjecture of Elliott
由: Gorodetsky, O, et al.
出版: (2024) -
The Erdős-Sós conjecture for geometric graphs
由: Luis Barba, et al.
出版: (2013-02-01) -
An Improved Upper Bound for the Erdős–Szekeres Conjecture
由: Mojarrad, Hossein Nassajian, et al.
出版: (2017)