A Note on a Question of Erdős and Graham

DOI10.1017/S0963548303005959zbMath1049.05077OpenAlexW2115811550MaRDI QIDQ4819238

No author found.

Publication date: 24 September 2004

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548303005959

zbMATH Keywords

arithmetic progressionRamsey theorySzemerédi's theoremFrankl-Rödl's theoremFürstenberg theorem

Mathematics Subject Classification ID

Extremal set theory (05D05) Arithmetic progressions (11B25)

Related Items (22)

Generalizations of Fourier analysis, and how to apply them ⋮ Density theorems and extremal hypergraph problems ⋮ A variant of the hypergraph removal lemma ⋮ Configurations of rectangles in \(\mathbb{F}_q^2\) ⋮ Distance sets relating to orthogonal exponentials ⋮ Local-vs-global combinatorics ⋮ The (7, 4)-Conjecture in Finite Groups ⋮ A measure-theoretic approach to the theory of dense hypergraphs ⋮ Counting configuration-free sets in groups ⋮ Unnamed Item ⋮ The hypergraph regularity method and its applications ⋮ Note on the 3-graph counting Lemma ⋮ Counting configuration-free sets in groups ⋮ The Gaussian primes contain arbitrarily shaped constellations ⋮ The symmetry preserving removal lemma ⋮ Generalizations of the removal lemma ⋮ Roth-type theorems in finite groups ⋮ A combinatorial proof of the removal lemma for groups ⋮ Distance sets that are a shift of the integers and Fourier basis for planar convex sets ⋮ From harmonic analysis to arithmetic combinatorics ⋮ A tight bound for hypergraph regularity ⋮ A relative Szemerédi theorem

This page was built for publication: A Note on a Question of Erdős and Graham