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. --

Cameron–Erdős conjecture

From Citizendium, the Citizens' Compendium
(Redirected from Cameron-Erdos conjecture)
Jump to: navigation, search
This article is a stub and thus not approved.
Main Article
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. It was proved by Ben Green in 2003.