Talk:Cameron–Erdős conjecture

From Citizendium
Revision as of 14:10, 29 October 2008 by 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.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is a stub and thus not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
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(2N/2). [d] [e]
Checklist and Archives
 Workgroup category:  Mathematics [Categories OK]
 Talk Archive:  none  English language variant:  British English
Fountain pen.png
 NOTICE, please do not remove from top of page.
Richard Pinch 20:10, 29 October 2008 (UTC)
Retrieved from "https://citizendium.org/wiki/index.php?title=Talk:Cameron–Erdős_conjecture&oldid=547373"