Online containers for hypergraphs, with applications to linear equations
From MaRDI portal
Publication:326815
DOI10.1016/j.jctb.2016.05.011zbMath1348.05142arXiv1611.01433OpenAlexW3105265682MaRDI QIDQ326815
David Saxton, Andrew G. Thomason
Publication date: 12 October 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.01433
Related Items
On solution-free sets of integers, Extremal problems in hypergraph colourings, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Blowup Ramsey numbers, List colorings of multipartite hypergraphs
Cites Work
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Dense uniform hypergraphs have high list chromatic number
- A random version of Sperner's theorem
- Hypergraph containers
- On the removal lemma for linear systems over abelian groups
- Supersaturated graphs and hypergraphs
- A variant of the hypergraph removal lemma
- The Cameron-Erdős conjecture
- On the number of graphs without 4-cycles
- Independent sets in regular graphs and sum-free subsets of finite groups
- The number of sum-free sets in abelian groups
- A removal lemma for systems of linear equations over finite fields
- List coloring hypergraphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- A Szemerédi-type regularity lemma in abelian groups, with applications
- List Colourings of Regular Hypergraphs
- Counting sumsets and sum-free sets modulo a prime
- Testability and repair of hereditary hypergraph properties
- Hypergraph list coloring and Euclidean Ramsey theory
- On Certain Sets of Positive Density
- On the Number of Sum-Free Sets
- A proof of Green's conjecture regarding the removal properties of sets of linear equations
- On list coloring Steiner triple systems
- On sets of integers containing k elements in arithmetic progression
- Solving a linear equation in a set of integers I
- Rado Partition Theorem for Random Subsets of Integers
- THE CAMERON–ERDOS CONJECTURE
- On the number of independent sets in expanders
- 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
- The symmetry preserving removal lemma
- Independent sets in hypergraphs
- Simple Containers for Simple Hypergraphs
- Stochastic Algorithms: Foundations and Applications
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- Sum-free sets in Abelian groups.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
