Abstract
Endre Szemerédi is a towering figure in combinatorics and one of the great mathematicians of the second half of the twentieth century. In this article we discuss some of his most famous results and give a flavour of their proofs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ajtai, M., Komlós, J., Szemerédi, E.: A note on Ramsey numbers. J. Comb. Theory, Ser. A 29, 354–360 (1980)
Ajtai, M., Komlós, J., Szemerédi, E.: A dense infinite Sidon sequence. Eur. J. Comb. 2, 1–11 (1981)
Ajtai, M., Komlós, J., Szemerédi, E.: An O(nlogn) sorting network. Combinatorica 3, 1–19 (1983)
Ajtai, M., Szemerédi, E.: Sets of lattice points that form no squares. Studia Sci. Math. Hung. 9, 9–11 (1975)
Bárány, I.: Applications of graph and hypergraph theory in geometry. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry. MSRI Publications, vol. 52, pp. 31–50 (2005)
Batcher, K.: Sorting networds and their applications. AFIPS Spring Joint Comput. Conf. 32, 307–314 (1968)
Bourgain, J., Vu, V.H., Wood, P.M.: On the singularity probability of discrete random matrices. http://arxiv.org/abs/0905.0461
Chung, F., Graham, R.L., Wilson, R.M.: Quasi-random graphs. Combinatorica 9, 345–362 (1989)
Elekes, Gy.: On the number of sums and products. Acta Arith. 81, 365–367 (1997)
Erdős, P.: Some remarks on the theory of graphs. Bull. Am. Math. Soc. 53, 292–294 (1947)
Erdős, P., Szemerédi, E.: On sums and products of integers. In: Erdős, P., Alpar, L., Halasz, G. (eds.) Studies in Pure Mathematics: To the Memory of Paul Turán, pp. 213–218. Birkhäuser, Basel (1983)
Erdős, P., Turán, P.: On some sequences of integers. J. Lond. Math. Soc. 11, 261–264 (1936)
Graver, J.E., Yackel, J.: Some graph theoretic results associated with Ramsey’s theorem. J. Comb. Theory 4, 125–175 (1968)
Guth, L., Katz, N.H.: On the Erdős distinct distances problem in the plane. http://arxiv.org/abs/1011.4105
Kahn, J., Komlós, J., Szemerédi, E.: On the probability that a random ±1-matrix is singular. J. Am. Math. Soc. 8, 223–240 (1995)
Kim, J.H.: The Ramsey number R(3,t) has order of magnitude t 2/logt. Random Struct. Algorithms 7, 173–207 (1995)
Komlós, J.: On the determinant of (0,1) matrices. Studia Sci. Math. Hung. 2, 387–399 (1968)
Komlós, J., Pintz, J., Szemerédi, E.: A lower bound for Heilbronn’s problem. J. Lond. Math. Soc. 25, 13–24 (1982)
Roth, K.F.: On a problem of Heilbronn. J. Lond. Math. Soc. 26, 198–204 (1951)
Roth, K.F.: On certain sets of integers, I. J. Lond. Math. Soc. 28, 104–109 (1953)
Roth, K.F.: On a problem of Heilbronn, II. Proc. Lond. Math. Soc. 25, 193–212 (1972)
Ruzsa, I.Z., Szemerédi, E.: Triple systems with no six points carrying three triangles. In: Combinatorics, Proc. Fifth Hungarian Colloq., Keszthely, 1976. Coll. Math. Soc. J. Bolyai 18, Volume II, pp. 939–945. North Holland, Amsterdam (1978)
Schmidt, W.M.: On a problem of Heilbronn. J. Lond. Math. Soc. 4, 545–550 (1972)
Solymosi, J.: Note on a generalization of Roth’s theorem. In: Pach, J. (ed.) Discrete and Computational Geometry. Algorithms Combin., vol. 25, pp. 825–827. Springer, Berlin (2003)
Székely, L.A.: Crossing numbers and hard Erdős problems in discrete geometry. Comb. Probab. Comput. 6, 353–358 (1997)
Szemerédi, E.: On sets of integers containing no k elements in arithmetic progression. Acta Arith. 27, 199–245 (1975)
Szemerédi, E., Trotter, W.T.: Extremal problems in discrete geometry. Combinatorica 3, 381–392 (1983)
Tao, T.: Some ingredients in Szemerédi’s proof of Szemerédi’s theorem. Blog post (2012). http://terrytao.wordpress.com/2012/03/23/some-ingredients-in-szemeredis-proof-of-szemeredis-theorem/
Tao, T., Vu, V.H.: On random ±1 matrices: singularity and determinant. Random Struct. Algorithms 28, 1–23 (2006)
Tao, T., Vu, V.H.: On the singularity probability of random Bernoulli matrices. J. Am. Math. Soc. 20, 603–628 (2007)
Thomason, A.: Pseudo-random graphs. In: Karoński, M. (ed.) Proceedings of Random Graphs, Poznań, 1985, pp. 307–331. North Holland, Amsterdam (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
1 Electronic Supplementary Material
Below are the links to the electronic supplementary material.
A lecture by Prof. Gowers in connection with the Abel Prize 2012 to Endre Szemeredi (MP4 295 MB)
A lecture by Prof. Lovasz in connection with the Abel Prize 2012 to Endre Szemeredi (MP4 266 MB)
The Abel Lecture by Endre Szemeredi, the Abel Laureate 2012 (MP4 316 MB)
A lecture by Prof. Wigderson in connection with the Abel Prize 2012 to Endre Szemeredi (MP4 345 MB)
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gowers, W.T. (2014). The Mathematics of Endre Szemerédi. In: Holden, H., Piene, R. (eds) The Abel Prize 2008-2012. The Abel Prize. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39449-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-39449-2_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39448-5
Online ISBN: 978-3-642-39449-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)