On the Number of Sum-Free Sets
From MaRDI portal
Publication:3491644
DOI10.1112/blms/22.2.141zbMath0709.11012OpenAlexW2002540659MaRDI QIDQ3491644
Publication date: 1990
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/blms/22.2.141
Other combinatorial number theory (11B75) Density, gaps, topology (11B05) Additive bases, including sumsets (11B13)
Related Items (19)
On the structure of large sum-free sets of integers ⋮ Graphs, partitions and Fibonacci numbers ⋮ Sum-free sets in abelian groups ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ Counting generalized sum-free sets ⋮ On the number of maximal sum-free sets ⋮ Independent sets in regular graphs and sum-free subsets of finite groups ⋮ The Cameron-Erdős conjecture ⋮ Hypergraph containers ⋮ 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 ⋮ Random sum-free subsets of abelian groups ⋮ Symmetric complete sum-free sets in cyclic groups ⋮ Asymptotics for the logarithm of the number of \(k\)-solution-free sets in abelian groups ⋮ A solution to a problem of Cameron on sum-free complete sets ⋮ Asymptotics for the Logarithm of the Number of (k, l)-Solution-Free Collections in an Interval of Naturals ⋮ ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP ⋮ On the regular sum-free sets ⋮ Cameron-Erdős modulo a prime
This page was built for publication: On the Number of Sum-Free Sets
