Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem
From MaRDI portal
Publication:1137067
DOI10.1016/0097-3165(80)90080-1zbMath0428.10027OpenAlexW2075411717MaRDI QIDQ1137067
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(80)90080-1
Related Items (3)
Large subsets of discrete hypersurfaces in \(\mathbb Z^d\) contain arbitrarily many collinear points ⋮ Unnamed Item ⋮ On catching a moving particle by narrow strips
Cites Work
- Strongly non-repetitive sequences and progression-free sets
- Some advances in the no-three-in-line problem
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Fourier-Stieltjes transforms of measures with a certain continuity property
- On certain sequences of lattice points
- Long walks in the plane with few collinear points
- Euclidean Ramsey theorems. I
- On nonrepetitive sequences
- Generalisation du theoreme de van der Waerden sur les semi-groupes repetitifs
- On sets of integers containing k elements in arithmetic progression
- On Arithmetic Progressions in Sequences
- Variations on Van Der Waerden's and Ramsey's Theorems
- The Prime Number Graph
- Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
- Note on Combinatorial Analysis
This page was built for publication: Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem
