ProbXiv
Explorersign in
Problem archiveProblem record

Statement

In combinatorics, the Cameron–Erdős conjecture (now a theorem) is the statement that the number of sum-free sets contained in [N]={1,…,N}[N]=\{1,\ldots,N\} is O(2N/2).O{\big (}{2^{N/2}}{\big)}. The sum of two odd numbers is even, so a set of odd numbers is always sum-free. There are ⌈N/2⌉\lceil N/2\rceil odd numbers in [N ], and so 2N/22^{N/2} subsets of odd numbers in [N ]. The Cameron–Erdős conjecture says that this counts a constant proportion of the sum-free sets. The conjecture was stated by Peter Cameron and Paul Erdős in 1988. It was proved by Ben Green and independently by Alexander Sapozhenko in 2003.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.