The sum of two odd numbers is even, so a set of odd numbers is always sum-free. There are odd numbers in |N|, and so subsets of odd numbers in |N|. The Cameron–Erdős conjecture says that this counts a constant proportion of the sum-free sets.
- Cameron, P. J.; Erdős, P. (1990), "On the number of sets of integers with various properties", Number theory: proceedings of the First Conference of the Canadian Number Theory Association, held at the Banff Center, Banff, Alberta, April 17-27, 1988, Berlin: de Gruyter, pp. 61–79, MR 1106651.
- Green, Ben (2004), "The Cameron-Erdős conjecture", The Bulletin of the London Mathematical Society, 36 (6): 769–778, MR 2083752, arXiv: , doi:10.1112/S0024609304003650.
- Sapozhenko, A. A. (2003), "The Cameron-Erdős conjecture", Doklady Akademii Nauk, 393 (6): 749–752, MR 2088503.
- Sapozhenko, Alexander A. (2008), "The Cameron-Erdős conjecture", Discrete Mathematics, 308 (19): 4361–4369, MR 2433862, doi:10.1016/j.disc.2007.08.103.
|This combinatorics-related article is a stub. You can help Wikipedia by expanding it.|