Cameron–Erdős conjecture: Difference between revisions
Jump to navigation
Jump to search
imported>Jitse Niesen (move references to subpage) |
mNo edit summary |
||
| Line 2: | Line 2: | ||
The '''Cameron–Erdős conjecture''' in the field of [[combinatorics]] is the statement that the number of [[sum-free set]]s contained in <math>\{1,\ldots,N\}</math> is <math>O\left({2^{N/2}}\right)</math>. | The '''Cameron–Erdős conjecture''' in the field of [[combinatorics]] is the statement that the number of [[sum-free set]]s contained in <math>\{1,\ldots,N\}</math> is <math>O\left({2^{N/2}}\right)</math>. | ||
The conjecture was stated by [[Peter Cameron (mathematician)|Peter Cameron]] and [[Paul Erdős]] in 1988. It was proved by [[Ben Green]] in 2003. | The conjecture was stated by [[Peter Cameron (mathematician)|Peter Cameron]] and [[Paul Erdős]] in 1988. It was proved by [[Ben Green]] in 2003.[[Category:Suggestion Bot Tag]] | ||
Latest revision as of 11:00, 24 July 2024
The Cameron–Erdős conjecture in the field of combinatorics is the statement that the number of sum-free sets contained in is .
The conjecture was stated by Peter Cameron and Paul Erdős in 1988. It was proved by Ben Green in 2003.