Note on a generalization of Roth's theorem
From MaRDI portal
The author gives a short proof for a theorem of \textit{M. Ajtai} and \textit{E. Szemerédi} [Studia Sci. Math. Hung. 9(1974), 9--11 (1975; Zbl 0303.10046)] that for sufficiently large \(N\), every subset of \([N]^2\) of size at least \(\delta N^2\) contains three points of the form \(\{(a,b), (a+d,b), (a,b+d)\}\). For the entire collection see [Zbl 1014.00040].
Recommendations
Cited in
(30)- A nonlinear version of Roth's theorem for sets of positive density in the real line
- Note on Roemer's indecomposability
- On Roth's theorem
- Additive combinatorics and graph theory
- A multidimensional Szemerédi theorem in the primes via combinatorics
- Bounds for graph regularity and removal lemmas
- The number of k-dimensional corner-free subsets of grids
- A relative Szemerédi theorem
- On a generalization of Szemerédi's theorem
- The Gaussian primes contain arbitrarily shaped constellations
- Short proofs of some extremal results. II.
- On Roth type conditions, duality and central Birkhoff sums for i.e.m.
- A note on Robinson-Ursescu and Lyusternik-Graves theorem
- scientific article; zbMATH DE number 3906649 (Why is no real title available?)
- A note on Rouche's theorem
- A note on a theorem of Raubenheimer and Rode
- A Note on a Question of Erdős and Graham
- Triforce and corners
- Proof of the Brown-Erdős-Sós conjecture in groups
- On the communication complexity of high-dimensional permutations
- scientific article; zbMATH DE number 6427377 (Why is no real title available?)
- A note on Rotfel’d Theorem in a sector
- Note on a Theorem of Routh
- Removal lemmas and approximate homomorphisms
- A generalization of a theorem of Rothschild and van Lint
- The sparse regularity method with Schatten norms and entropy
- Improved bounds for skew corner-free sets
- Arithmetic progressions, different regularity lemmas and removal lemmas
- A variant of the hypergraph removal lemma
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
This page was built for publication: Note on a generalization of Roth's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692730)