The number of maximal sum-free subsets of integers

DOI10.1090/S0002-9939-2015-12615-9zbMath1378.11019arXiv1409.5661MaRDI QIDQ2944846

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

Publication date: 8 September 2015

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Extremal combinatorics (05D99) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (17)

On the structure of large sum-free sets of integers ⋮ The number of maximum primitive sets of integers ⋮ THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS ⋮ On maximal sum-free sets in abelian groups ⋮ A sharp bound on the number of maximal sum-free sets ⋮ The number of the maximal triangle-free graphs ⋮ On solution-free sets of integers ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza ⋮ The number of multiplicative Sidon sets of integers ⋮ The counting version of a problem of Erdős ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Enumerating solution-free sets in the integers ⋮ On the complexity of finding and counting solution-free sets of integers ⋮ Groups with few maximal sum-free sets ⋮ Symmetric complete sum-free sets in cyclic groups ⋮ Counting Gallai 3-colorings of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A combinatorial proof of the removal lemma for groups
• Bounds on the number of maximal sum-free sets
• Sharp bound on the number of maximal sum-free subsets of integers
• Counting maximal antichains and independent sets
• A Szemerédi-type regularity lemma in abelian groups, with applications
• On the number of maximal sum-free sets
• The number of the maximal triangle-free graphs
• Counting sumsets and sum-free sets modulo a prime
• Notes on Sum-Free and Related Sets
• THE CAMERON–ERDOS CONJECTURE
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• A refinement of the Cameron-Erdős conjecture
• On cliques in graphs

This page was built for publication: The number of maximal sum-free subsets of integers