Random sum-free subsets of abelian groups
From MaRDI portal
Publication:2017135
DOI10.1007/s11856-013-0071-2zbMath1370.11040arXiv1103.2041OpenAlexW2143156974MaRDI QIDQ2017135
József Balogh, Robert Morris, Wojciech Samotij
Publication date: 25 June 2014
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.2041
Other combinatorial number theory (11B75) Abelian groups (20K99) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items
The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Stability results for random discrete structures, Counting sum-free sets in abelian groups, Random sum-free subsets of abelian groups, The sum-free process
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- A structure theorem for Boolean functions with small total influences
- Hypergraph containers
- A combinatorial proof of the removal lemma for groups
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Threshold functions
- Independent sets in regular graphs and sum-free subsets of finite groups
- On Schur properties of random subsets of integers
- Cameron-Erdős modulo a prime
- Counting sum-free sets in abelian groups
- Random sum-free subsets of abelian groups
- Sum-free sets in abelian groups
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Counting sumsets and sum-free sets modulo a prime
- Ramsey properties of random discrete structures
- Extremal subgraphs of random graphs
- Mantel's theorem for random graphs
- A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
- On the Number of Sum-Free Sets
- On Sum-Free Subsequences
- Sum-Free Sets of Integers
- Sharp thresholds of graph properties, and the $k$-sat problem
- Rado Partition Theorem for Random Subsets of Integers
- THE CAMERON–ERDOS CONJECTURE
- Extremal subgraphs of random graphs
- Every monotone graph property has a sharp threshold
- Threshold Functions for Ramsey Properties
- Arithmetic progressions of length three in subsets of a random set
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Independent sets in hypergraphs
- A refinement of the Cameron-Erdős conjecture
- Stability results for random discrete structures
- Maximal Sum-Free Sets of Group Elements
- Maximal sum-free sets of elements of finite groups
- Structure of maximal sum-free sets in groups of order $3p$
- On Certain Sets of Integers
- Sum-free sets in Abelian groups.
