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

Jitse Niesen (Talk | contribs) m (Cameron-Erdos conjecture moved to Cameron–Erdős conjecture: correct spelling) |
Jitse Niesen (Talk | contribs) (move references to subpage) |
||

Line 1: | Line 1: | ||

{{subpages}} | {{subpages}} | ||

− | The ''' | + | 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 | + | The conjecture was stated by [[Peter Cameron (mathematician)|Peter Cameron]] and [[Paul Erdős]] in 1988. It was proved by [[Ben Green]] in 2003. |

− | + | ||

− | + | ||

− | + |

## Latest revision as of 16:47, 18 June 2009

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.