Counting sum-free sets in abelian groups
From MaRDI portal
Publication:2017119
DOI10.1007/s11856-013-0067-yzbMath1332.11030arXiv1201.6654OpenAlexW1970126555WikidataQ105583497 ScholiaQ105583497MaRDI QIDQ2017119
József Balogh, Robert Morris, Wojciech Samotij, Noga Alon
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/1201.6654
Type Isum-free set\((n, d, \lambda)\)-graphmaximum-size sum-free subsetsecond eigenvalue of a graphsum-free subsets of size mType I(q)
Other combinatorial number theory (11B75) Finite abelian groups (20K01) Ramsey theory (05D10) Additive bases, including sumsets (11B13)
Related Items
On the structure of large sum-free sets of integers, THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS, On the number of matroids, On maximal sum-free sets in abelian groups, Maximum number of sum-free colorings in finite abelian groups, Groups containing small locally maximal product-free sets, How many delta-matroids are there?, A note on the largest sum‐free sets of integers, The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups, On the Number ofBh-Sets, A characterization of elementary abelian 2-groups, Sum-Free Sets of Integers with a Forbidden Sum, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On the number of matroids compared to the number of sparse paving matroids, Independent sets in graphs, Stability results for random discrete structures, Intersecting families of discrete structures are typically trivial, The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers, Right-angled Coxeter groups, universal graphs, and Eulerian polynomials, Random sum-free subsets of abelian groups, Sum-free subsets of finite abelian groups of type III, Counting Gallai 3-colorings of complete graphs, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Independent sets in hypergraphs, Counting independent sets in graphs
Cites Work
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- The number of \(K_{m,m}\)-free graphs
- Matchings and independent sets of a fixed size in regular graphs
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Explicit construction of linear sized tolerant networks
- On the number of graphs without 4-cycles
- Independent sets in regular graphs and sum-free subsets of finite groups
- On Schur properties of random subsets of integers
- For which densities are random triangle-free graphs almost surely bipartite?
- Random sum-free subsets of abelian groups
- Sum-free sets in abelian groups
- Sharp bounds for some multicolour Ramsey numbers
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- Entropy, independent sets and antichains: A new approach to Dedekind’s problem
- A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
- Expander graphs and their applications
- The Number of Independent Sets in a Regular Graph
- K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
- On sets of integers containing k elements in arithmetic progression
- Rado Partition Theorem for Random Subsets of Integers
- Extremal subgraphs of random graphs
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- On the asymptotic structure of sparse triangle free graphs
- 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
- The number of K s,t -free graphs
- A refinement of the Cameron-Erdős conjecture
- Maximal sum-free sets of elements of finite groups
- On the structure of linear graphs
- Sum-free sets in Abelian groups.
