NOTICE: Citizendium is still being set up on its newer server, treat as a beta for now; please see here for more.
Citizendium - a community developing a quality comprehensive compendium of knowledge, online and free. Click here to join and contribute—free
CZ thanks our previous donors. Donate here. Treasurer's Financial Report -- Thanks to our content contributors. --

Difference between revisions of "Cameron–Erdős conjecture"

From Citizendium, the Citizens' Compendium
Jump to: navigation, search
(remove WPmarkup; subpages)
(No difference)

Revision as of 15:37, 18 June 2009

This article is a stub and thus not approved.
Main Article
Talk
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and not meant to be cited; by editing it you can help to improve it towards a future approved, citable version. These unapproved articles are subject to a disclaimer.

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[1]. It was proved by Ben Green in 2003[2] [3].

References

  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