The following pages link to A relative Szemerédi theorem (Q2355780):
Displayed 22 items.
- Large gaps between consecutive prime numbers (Q291020) (← links)
- Erratum to ``The primes contain arbitrarily long polynomial progressions'' (Q362063) (← links)
- Arithmetic progressions in multiplicative groups of finite fields (Q1686398) (← links)
- A multidimensional Szemerédi theorem in the primes via combinatorics (Q1710999) (← links)
- Dirac-type theorems in random hypergraphs (Q2131868) (← links)
- The Green-Tao theorem for primes of the form \(x^2+y^2+1\) (Q2313399) (← links)
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle (Q2351746) (← links)
- Counting results for sparse pseudorandom hypergraphs. I. (Q2400983) (← links)
- A transference principle for systems of linear equations, and applications to almost twin primes (Q2691620) (← links)
- Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers (Q3186424) (← links)
- Szemerédi's Theorem in the Primes (Q4631377) (← links)
- An analytic approach to sparse hypergraphs: hypergraph removal (Q4645028) (← links)
- Arithmetic properties of sparse subsets of $\mathbb{Z}^n$ (Q4989355) (← links)
- Weak hypergraph regularity and applications to geometric Ramsey theory (Q5068114) (← links)
- Uniformity norms, their weaker versions, and applications (Q5084402) (← links)
- POLYNOMIAL PATTERNS IN THE PRIMES (Q5226582) (← links)
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions (Q5227976) (← links)
- The regularity method for graphs with few 4‐cycles (Q5874028) (← links)
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits (Q5886111) (← links)
- Removal lemmas and approximate homomorphisms (Q5886340) (← links)
- Diagonal Ramsey via effective quasirandomness (Q6046448) (← links)
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs (Q6074706) (← links)