Cameron–Erdős conjecture

From Citizendium, the Citizens' Compendium

Jump to: navigation, search


This article is a stub and thus not approved.
Main Article
Talk
Related Articles  [?]
Bibliography  [?]
External Links  [?]
 
http://en.citizendium.org/wiki?title=Cameron%E2%80%93Erd%C5%91s_conjecture&printable=yes
This is a draft article, under development and not meant to be cited but you can help to improve it. 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 \{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.

Retrieved from "http://en.citizendium.org/wiki/Cameron%E2%80%93Erd%C5%91s_conjecture"
Views
Personal tools