Sharp bound on the number of maximal sum-free subsets of integers

DOI10.4171/JEMS/802zbMath1454.11050arXiv1502.07605MaRDI QIDQ1664347

Andrew Treglown, Maryam Sharifzadeh, Hong Liu, József Balogh

Publication date: 24 August 2018

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

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

zbMATH Keywords

sum-free setsindependent setscontainer method

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items (16)

On the number of sum-free triplets of sets ⋮ On the structure of large sum-free sets of integers ⋮ The number of maximum primitive sets of integers ⋮ Integer colorings with no rainbow 3-term arithmetic progression ⋮ On maximal sum-free sets in abelian groups ⋮ The number of maximal sum-free subsets of integers ⋮ On the number of sets with a given doubling constant ⋮ Maximal independent sets in clique-free graphs ⋮ On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza ⋮ A note on the largest sum‐free sets of integers ⋮ The number of multiplicative Sidon sets of integers ⋮ Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice ⋮ The counting version of a problem of Erdős ⋮ On the number of points in general position in the plane ⋮ Groups with few maximal sum-free sets ⋮ Shape of the asymptotic maximum sum-free sets in integer lattice grids

This page was built for publication: Sharp bound on the number of maximal sum-free subsets of integers