THE CAMERON–ERDOS CONJECTURE
From MaRDI portal
Publication:4660458
Abstract: A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).
Recommendations
Cited in
(54)- The extent to which subsets are additively closed
- Bounds on the number of maximal sum-free sets
- Sum-free sets and related sets
- On the structure of large sum-free sets of integers
- Upper tails for arithmetic progressions in random subsets
- On the complexity of finding and counting solution-free sets of integers
- Asymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime order
- Asymptotics of the number of sum-free sets in groups of prime order
- Groups with few maximal sum-free sets
- Random sum-free subsets of abelian groups
- Integer colorings with no rainbow 3-term arithmetic progression
- On maximal sum-free sets in abelian groups
- On the number of sets with a given doubling constant
- Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice
- The counting version of a problem of Erdős
- On the missing log in upper tail estimates
- Asymptotics for the logarithm of the number of \(k\)-solution-free sets in abelian groups
- Counting independent sets in graphs
- Sum-free sets in abelian groups
- Objective functions with redundant domains
- Groups containing small locally maximal product-free sets
- On solution-free sets of integers
- The number of multiplicative Sidon sets of integers
- A characterization of elementary abelian 2-groups
- Large sum-free sets in \(\mathbb Z/p\mathbb Z\)
- On the maximum number of integer colourings with forbidden monochromatic sums
- scientific article; zbMATH DE number 981678 (Why is no real title available?)
- The number of maximal sum-free subsets of integers
- On the number of sum-free sets
- A sharp bound on the number of maximal sum-free sets
- Online containers for hypergraphs, with applications to linear equations
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Bounds on the Number of Maximal Sum-Free Sets
- The number of independent sets in a regular graph
- Beyond sum-free sets in the natural numbers
- Almost Odd Random Sum-Free Sets
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- Sum-free sets of integers with a forbidden sum
- Hypergraph containers
- Asymptotics for the logarithm of the number of (k,l)-solution-free collections in an interval of naturals
- Enumerating solution-free sets in the integers
- The largest (k,)-sum-free sets in compact Abelian groups
- Classifications of \(\ell\)-zero-sumfree sets
- The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
- A Cameron and Erdős conjecture on counting primitive sets
- A refinement of the Cameron-Erdős conjecture
- Estimates of the Cameron–Erdős constants
- On the number of independent sets in damaged Cayley graphs
- The negative answer to Kameko's conjecture on the hit problem
- A note on the largest sum‐free sets of integers
- Maximal sum-free and triangle-free sets in \(\mathbb{Z}_5^k\)
- On the evolution of structure in triangle-free graphs
- On Lev's periodicity conjecture
- The Cameron-Erdős conjecture
This page was built for publication: THE CAMERON–ERDOS CONJECTURE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660458)
