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 "Talk:Cameron–Erdős conjecture"

From Citizendium, the Citizens' Compendium
Jump to: navigation, search
(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.)
 
 
(No difference)

Latest revision as of 15:37, 18 June 2009

This article is a stub and thus not approved.
Main Article
Talk
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to fill out this checklist, please see CZ:The Article Checklist. To update this checklist edit the metadata template.
 Definition The number of sum-free sets contained in {1, 2, …, N} is O(2N/2). [d] [e]
Fountain pen.png
NOTICE, please do not remove from top of page.
Richard Pinch 20:10, 29 October 2008 (UTC)