A refinement of the Cameron-Erdős conjecture
From MaRDI portal
Publication:5398437
DOI10.1112/plms/pdt033zbMath1284.05024arXiv1202.5200OpenAlexW3103069393WikidataQ123232912 ScholiaQ123232912MaRDI QIDQ5398437
Robert Morris, József Balogh, Noga Alon, Wojciech Samotij
Publication date: 28 February 2014
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.5200
Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75) Asymptotic enumeration (05A16) Additive bases, including sumsets (11B13)
Related Items
On the structure of large sum-free sets of integers ⋮ The number of maximal sum-free subsets of integers ⋮ On the number of sets with a given doubling constant ⋮ The Typical Approximate Structure of Sets with Bounded Sumset ⋮ Counting sets with small sumset and applications ⋮ The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups ⋮ Sum-Free Sets of Integers with a Forbidden Sum ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Counting sum-free sets in abelian groups ⋮ Random sum-free subsets of abelian groups ⋮ Symmetric complete sum-free sets in cyclic groups ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Independent sets in hypergraphs ⋮ Counting independent sets in graphs
