A relative Szemerédi theorem
From MaRDI portal
Publication:2355780
DOI10.1007/S00039-015-0324-9zbMath1345.11008arXiv1305.5440OpenAlexW1836492331WikidataQ56341574 ScholiaQ56341574MaRDI QIDQ2355780
Yufei Zhao, David Conlon, Jacob Fox
Publication date: 28 July 2015
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.5440
Related Items (22)
A counterexample to the Bollobás–Riordan conjectures on sparse graph limits ⋮ Removal lemmas and approximate homomorphisms ⋮ Dirac-type theorems in random hypergraphs ⋮ Large gaps between consecutive prime numbers ⋮ Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers ⋮ Weak hypergraph regularity and applications to geometric Ramsey theory ⋮ Arithmetic properties of sparse subsets of $\mathbb{Z}^n$ ⋮ Counting results for sparse pseudorandom hypergraphs. I. ⋮ Erratum to ``The primes contain arbitrarily long polynomial progressions ⋮ Uniformity norms, their weaker versions, and applications ⋮ Diagonal Ramsey via effective quasirandomness ⋮ Arithmetic progressions in multiplicative groups of finite fields ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ A transference principle for systems of linear equations, and applications to almost twin primes ⋮ A multidimensional Szemerédi theorem in the primes via combinatorics ⋮ Szemerédi's Theorem in the Primes ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ POLYNOMIAL PATTERNS IN THE PRIMES ⋮ An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions ⋮ The Green-Tao theorem for primes of the form \(x^2+y^2+1\) ⋮ A multi-dimensional Szemerédi theorem for the primes via a correspondence principle ⋮ The regularity method for graphs with few 4‐cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- On the KŁR conjecture in random graphs
- Hypergraph containers
- The primes contain arbitrarily long polynomial progressions
- A variant of the hypergraph removal lemma
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Linear equations in primes
- A combinatorial proof of the removal lemma for groups
- Quick approximation to matrices and applications
- An ergodic Szemerédi theorem for commuting transformations
- A multidimensional Szemerédi theorem in the primes via combinatorics
- A removal lemma for systems of linear equations over finite fields
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- The primes contain arbitrarily long arithmetic progressions
- Extremal results in sparse pseudorandom graphs
- The Gaussian primes contain arbitrarily shaped constellations
- Hypergraph regularity and the multidimensional Szemerédi theorem
- A Szemerédi-type regularity lemma in abelian groups, with applications
- A note on the random greedy independent set algorithm
- Constellations in Pd
- Linear correlations amongst numbers represented by positive definite binary quadratic forms
- A short proof of the multidimensional Szemerédi theorem in the primes
- Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
- An Efficient Sparse Regularity Concept
- Green–Tao theorem in function fields
- A proof of Green's conjecture regarding the removal properties of sets of linear equations
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- Metrics for sparse graphs
- On sets of integers containing k elements in arithmetic progression
- Szemerédi’s Regularity Lemma for Sparse Graphs
- Extremal problems on set systems
- An analytic approach to sparse hypergraphs: hypergraph removal
- Regularity Lemma for k-uniform hypergraphs
- A Note on a Question of Erdős and Graham
- Independent sets in hypergraphs
- Correlations of the divisor function
- An arithmetic transference proof of a relative Szemerédi theorem
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- Quasi-random graphs
- A new proof of Szemerédi's theorem
This page was built for publication: A relative Szemerédi theorem
