THE CAMERON–ERDOS CONJECTURE

DOI10.1112/S0024609304003650zbMATH Open1074.11013arXivmath/0304058OpenAlexW2145092624WikidataQ28315716 ScholiaQ28315716MaRDI QIDQ4660458FDOQ4660458

Authors: Ben Green 

Publication date: 21 March 2005

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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)).

Full work available at URL: https://arxiv.org/abs/math/0304058

Recommendations

• The Cameron-Erdős conjecture
• On the number of sum-free sets
• A refinement of the Cameron-Erdős conjecture
• Sum-free sets and related sets
• Estimates of the Cameron–Erdős constants

zbMATH Keywords

granularizationsumfree set

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Exponential sums and character sums (11L99)

Cited In (50)

• A Cameron and Erdős conjecture on counting primitive sets
• The number of maximal sum-free subsets of integers
• Sum-free sets in abelian groups
• Beyond sum-free sets in the natural numbers
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Counting independent sets in graphs
• Hypergraph containers
• Bounds on the Number of Maximal Sum-Free Sets
• On the structure of large sum-free sets of integers
• The extent to which subsets are additively closed
• Estimates of the Cameron–Erdős constants
• Random sum-free subsets of abelian groups
• On the complexity of finding and counting solution-free sets of integers
• Classifications of \(\ell\)-zero-sumfree sets
• Asymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime order
• A characterization of elementary abelian 2-groups
• The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
• Asymptotics for the logarithm of the number of \((k,l)\)-solution-free collections in an interval of naturals
• Integer colorings with no rainbow 3-term arithmetic progression
• On solution-free sets of integers
• Title not available (Why is that?)
• Independent sets in hypergraphs and Ramsey properties of graphs and the integers
• The number of independent sets in a regular graph
• The number of multiplicative Sidon sets of integers
• Asymptotics for the logarithm of the number of \(k\)-solution-free sets in abelian groups
• On the missing log in upper tail estimates
• A sharp bound on the number of maximal sum-free sets
• Online containers for hypergraphs, with applications to linear equations
• Asymptotics of the number of sum-free sets in groups of prime order
• Groups with few maximal sum-free sets
• Upper tails for arithmetic progressions in random subsets
• Large sum-free sets in \(\mathbb Z/p\mathbb Z\)
• On maximal sum-free sets in abelian groups
• Objective functions with redundant domains
• Bounds on the number of maximal sum-free sets
• Sum-free sets of integers with a forbidden sum
• On the number of sets with a given doubling constant
• The Cameron-Erdős conjecture
• Groups containing small locally maximal product-free sets
• On the maximum number of integer colourings with forbidden monochromatic sums
• On the number of sum-free sets
• On the number of independent sets in damaged Cayley graphs
• Almost Odd Random Sum-Free Sets
• The counting version of a problem of Erdős
• The largest \((k,\ell)\)-sum-free sets in compact Abelian groups
• Enumerating solution-free sets in the integers
• Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice
• A note on the largest sum‐free sets of integers
• A refinement of the Cameron-Erdős conjecture
• The negative answer to Kameko's conjecture on the hit problem

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)