Cameron–Erdős conjecture: Difference between revisions

Revision as of 09:37, 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^[1]. It was proved by Ben Green in 2003^[2] ^[3].

References

↑ 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
↑ B. Green, The Cameron-Erdős conjecture, 2003.
↑ B. Green, The Cameron-Erdős conjecture, Bulletin of the London Mathematical Society 36 (2004) pp.769-778

[1] 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

[2] B. Green, The Cameron-Erdős conjecture, 2003.

[3] B. Green, The Cameron-Erdős conjecture, Bulletin of the London Mathematical Society 36 (2004) pp.769-778

[1]

[2]

[3]

Revision as of 14:07, 29 October 2008 (view source) imported>Richard Pinch (remove WPmarkup; subpages) ← Older edit	Revision as of 09:37, 18 June 2009 (view source) imported>Jitse Niesen m (Cameron-Erdos conjecture moved to Cameron–Erdős conjecture: correct spelling) Newer edit →
(No difference)

Cameron–Erdős conjecture: Difference between revisions

Revision as of 09:37, 18 June 2009

References

Navigation menu

Search