Enumerating solution-free sets in the integers
From MaRDI portal
Publication:509275
DOI10.1016/j.endm.2016.11.004zbMath1355.05187OpenAlexW2558749092MaRDI QIDQ509275
Robert Hancock, Andrew Treglown
Publication date: 9 February 2017
Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/36525706/TCDM2016format1.pdf
Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Hypergraph containers
- On Roth's theorem on progressions
- Extremal subsets of \(\{1,\dots ,n\}\) avoiding solutions to linear equations in three variables
- Bounds on the number of maximal sum-free sets
- Sum-free sets and related sets
- Counting generalized sum-free sets
- An improved construction of progression-free sets
- The structure of maximum subsets of \(\{1,\dots,n\}\) with no solutions to \(a+b=kc\)
- A Szemerédi-type regularity lemma in abelian groups, with applications
- The number of (2,3)-sum-free subsets of { 1,...,n}
- On the number of maximal sum-free sets
- The number of the maximal triangle-free graphs
- The number of maximal sum-free subsets of integers
- A Note on Elkin’s Improvement of Behrend’s Construction
- Notes on Sum-Free and Related Sets
- Solving a linear equation in a set of integers I
- THE CAMERON–ERDOS CONJECTURE
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- Solving a linear equation in a set of integers II
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- On solution-free sets of integers II
- On finite pattern-free sets of integers
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On cliques in graphs
This page was built for publication: Enumerating solution-free sets in the integers
