Abstract
We give a simple proof that for sufficiently large N, every subset of of size[N 2]of size at least δN 2 contains three points of the form (a,b), (a + d, b), (a, b + d).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Ajtai and E. Szemer¡äedi, Sets of Lattice Points That Form No Squares.Studia Scientiarum Mathematicarum Hungarica. 9 (1974), 9¨C11.
H. F¡§urstenberg and Y. Katznelson, A density version of the Hales-Jewett theorem.J.d’Analyse Math. 57 (1991), 64¨C119.
W.T. Gowers, A new proof of Szemer¡äedi’s theorem.GAFA, Geom. Funct. Anal. 11 (2001) 465¨C588.
W.T. Gowers, Rough structure and classification.GAFA, Geom. Funct. Anal. Special Volume - GAFA2000 ¡°Visions in Mathematics¡±, Tel Aviv, 1999. Part I,79¨C117.
J. Koml¡äos and M. Simonovits, Szemer¡äedi’s Regularity Lemma and its applications in graph theory. in: Combinatorics, Paul Erdőos is eighty, Vol. 2 (Keszthely,1993), 295¨C352, Bolyai Soc. Math. Stud., 2, J¡äanos Bolyai Math. Soc., Budapest
K.F. Roth On certain sets of integersJ.London Math. Soc. 28 (1953), 245¨C252.
I.Z. Ruzsa and E. Szemer¡äedi, Triple systems with no six points carrying three triangles. in: Colloquia Mathematica Societatis J¡äanos Bolyai, 18. Combinatorics, Keszthely (Hungary), 1976, 939¨C945.
E. Szemer¡äedi, On sets of integers containing no k elements in arithmetical progression.Acta Arithmetica 27 (1975), 199¨C245.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Solymosi, J. (2003). Note on a Generalization of Roth’s Theorem. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds) Discrete and Computational Geometry. Algorithms and Combinatorics, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55566-4_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-55566-4_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62442-1
Online ISBN: 978-3-642-55566-4
eBook Packages: Springer Book Archive