Cameron–Erdős conjecture: Difference between revisions

Latest revision as of 11:47, 18 June 2009

Main Article

Discussion

Related Articles ^[?]

Bibliography ^[?]

External Links ^[?]

Citable Version ^[?]

This editable Main Article is under development and subject to a disclaimer.

[edit intro]

The Cameron–Erdős conjecture in the field of combinatorics is the statement that the number of sum-free sets contained in $\{1,\ldots ,N\}$ is $O\left({2^{N/2}}\right)$ .

The conjecture was stated by Peter Cameron and Paul Erdős in 1988. It was proved by Ben Green in 2003.

@@ Line 1: / Line 1: @@
 {{subpages}}
-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<ref>P.J. Cameron and P. Erdős, ''On the number of sets of integers with various properties'', Number theory (Banff, 1988), de Gruyter, Berlin 1990, pp.61-79</ref>.  It was proved by [[Ben Green]] in 2003<ref>B. Green, [http://www.arxiv.org/pdf/math.NT/0304058 The Cameron-Erdős conjecture], 2003.</ref> <ref>B. Green, ''The Cameron-Erdős conjecture'', Bulletin of the [[London Mathematical Society]] '''36''' (2004) pp.769-778</ref>.
+The conjecture was stated by [[Peter Cameron (mathematician)|Peter Cameron]] and [[Paul Erdős]] in 1988.  It was proved by [[Ben Green]] in 2003.
-==References==
-<references/>

Cameron–Erdős conjecture: Difference between revisions

Latest revision as of 11:47, 18 June 2009

Navigation menu

Search