The number of maximal sum-free subsets of integers

DOI10.1090/S0002-9939-2015-12615-9zbMATH Open1378.11019arXiv1409.5661MaRDI QIDQ2944846FDOQ2944846

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

Publication date: 8 September 2015

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

Abstract: Cameron and ErdH{o}s raised the question of how many maximal sum-free sets there are in $1,dots,n$, giving a lower bound of $2^{lfloorn/4floor}$. In this paper we prove that there are in fact at most $2^{(1/4+o(1))n}$ maximal sum-free sets in $1,dots,n$. Our proof makes use of container and removal lemmas of Green as well as a result of Deshouillers, Freiman, S'os and Temkin on the structure of sum-free sets.

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

Recommendations

• A sharp bound on the number of maximal sum-free sets
• Sharp bound on the number of maximal sum-free subsets of integers
• A refinement of the Cameron-Erdős conjecture
• Bounds on the number of maximal sum-free sets
• Bounds on the Number of Maximal Sum-Free Sets

Mathematics Subject Classification ID

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

Cites Work

• On cliques in graphs
• Title not available (Why is that?)
• Bounds on the number of maximal sum-free sets
• Sharp bound on the number of maximal sum-free subsets of integers
• 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
• Title not available (Why is that?)
• THE CAMERON–ERDOS CONJECTURE
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• A combinatorial proof of the removal lemma for groups
• Counting maximal antichains and independent sets
• A refinement of the Cameron-Erdős conjecture

Cited In (25)

• Counting Gallai 3-colorings of complete graphs
• The Largest Sum-Free Subsequence from a Sequence of n Numbers
• The number of the maximal triangle-free graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Bounds on the Number of Maximal Sum-Free Sets
• On the structure of large sum-free sets of integers
• On the complexity of finding and counting solution-free sets of integers
• The Typical Approximate Structure of Sets with Bounded Sumset
• The number of \((2,3)\)-sum-free subsets of \(\{1,\dots,n\}\)
• On solution-free sets of integers
• The largest $(k,\ell )$-sum-free subsets
• The number of multiplicative Sidon sets of integers
• A sharp bound on the number of maximal sum-free sets
• Maximum number of sum-free colorings in finite abelian groups
• The number of maximum primitive sets of integers
• Groups with few maximal sum-free sets
• On maximal sum-free sets in abelian groups
• On the maximum number of integer colourings with forbidden monochromatic sums
• Sharp bound on the number of maximal sum-free subsets of integers
• The counting version of a problem of Erdős
• The typical structure of maximal triangle-free graphs
• Shape of the asymptotic maximum sum-free sets in integer lattice grids
• Enumerating solution-free sets in the integers
• On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza
• A refinement of the Cameron-Erdős conjecture

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944846)