Talk:Cameron–Erdős conjecture: Difference between revisions

Latest revision as of 10:37, 18 June 2009

Citable Version ^[?]

To learn how to update the categories for this article, see here. To update categories, edit the metadata template.

Definition: The number of sum-free sets contained in {1, 2, …, N} is O(2^N/2). [d] [e]

Checklist and Archives

Workgroup category: Mathematics [Categories OK]
Talk Archive: none	English language variant: British English

Unused subpages
Unused subpages: - External Links - Works - Discography - Filmography - Catalogs - Timelines - Gallery - Audio - Video - Code - Tutorials - Student Level - Signed Articles - Function - Addendum - Debate Guide - Advanced - Recipes - Citable Version

	NOTICE, please do not remove from top of page.

	Richard Pinch 20:10, 29 October 2008 (UTC)

Revision as of 15:10, 29 October 2008 (view source) imported>Richard Pinch (I released this article to the Wikipedia. In particular, the identical text that appears there is of my authorship. Therefore, no credit for Wikipedia content on Citizendium applies.)	Latest revision as of 10:37, 18 June 2009 (view source) imported>Jitse Niesen m (Talk:Cameron-Erdos conjecture moved to Talk:Cameron–Erdős conjecture: correct spelling)
(No difference)