Sum-Free Sets of Integers with a Forbidden Sum
From MaRDI portal
Publication:4627481
DOI10.1137/17M1157532zbMath1440.11008arXiv1812.09594OpenAlexW2963332323MaRDI QIDQ4627481
Publication date: 11 March 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.09594
Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Hypergraph containers
- On sum-free sets modulo \(p\)
- Subset sums
- On the number of graphs without 4-cycles
- On the structure of large sum-free sets of integers
- Dioid partitions of groups
- Counting sets with small sumset and applications
- A removal lemma for systems of linear equations over finite fields
- On the structure of a random sum-free set
- Counting sum-free sets in abelian groups
- Counting independent sets in graphs
- Large sum-free sets in \(\mathbb Z/p\mathbb Z\)
- A Szemerédi-type regularity lemma in abelian groups, with applications
- A refined bound for sum-free sets in groups of prime order
- Almost Odd Random Sum-Free Sets
- THE CAMERON–ERDOS CONJECTURE
- Independent sets in hypergraphs
- A refinement of the Cameron-Erdős conjecture
- Maximal sum-free sets of elements of finite groups
- Maximal sum-free sets in finite abelian groups
- Structure of maximal sum-free sets in $C_p$
- Symmetric complete sum-free sets in cyclic groups
This page was built for publication: Sum-Free Sets of Integers with a Forbidden Sum