A refinement of the Cameron-Erd\H{o}s Conjecture

TL;DR

This paper refines the Cameron-Erdős conjecture by providing a precise upper bound on the number of sum-free subsets of a given size within the first n positive integers, using advanced combinatorial methods.

Contribution

It establishes a sharp upper bound on the count of sum-free subsets of size m, refining previous asymptotic results and employing novel hypergraph and partition bounds.

Findings

Number of sum-free subsets of size m is bounded by 2^{O(n/m)} times a binomial coefficient.

The bound is sharp for m ≥ √n.

Utilizes a new hypergraph independent set bound and partition estimates.

Abstract

In this paper we study sum-free subsets of the set $\{1,...,n\}$, that is, subsets of the first $n$ positive integers which contain no solution to the equation $x + y = z$. Cameron and Erd\H{o}s conjectured in 1990 that the number of such sets is $O(2^{n/2})$. This conjecture was confirmed by Green and, independently, by Sapozhenko. Here we prove a refined version of their theorem, by showing that the number of sum-free subsets of $[n]$ of size $m$ is $2^{O(n/m)} {\lceil n/2 \rceil \choose m}$, for every $1 \le m \le \lceil n/2 \rceil$. For $m \ge \sqrt{n}$, this result is sharp up to the constant implicit in the $O(\cdot)$. Our proof uses a general bound on the number of independent sets of size $m$ in 3-uniform hypergraphs, proved recently by the authors, and new bounds on the number of integer partitions with small sumset.