Abstract
Quite a while before Ramsey proved his partition theorem for finite sets some results have been established which can be viewed as the earliest roots of Ramsey theory. The probably first one is due to David Hilbert (1892).
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
Baumgartner, J.E.: A short proof of Hindman’s theorem. J. Comb. Theory A 17, 384–386 (1974)
Berlekamp, E.R.: A construction for partitions which avoid long arithmetic progressions. Can. Math. Bull. 11, 409–414 (1968)
Brauer, A.: Über Sequenzen von Potenzresten. Sitzungsber. Preuß. Akad. Wiss. Math. Phy. Kl pp. 9–16 (1928)
Brauer, A.: Gedenkrede auf Issai Schur. In: Brauer, A., Rohrbach, H. (eds.) Issai Schur, Gesammelte Abhandlungen, pp. v–xiv. Springer, Berlin (1973)
Brown, T.C., Erdős, P., Chung, F.R.K., Graham, R.L.: Quantitative forms of a theorem of Hilbert. J. Comb. Theory A 38, 210–216 (1985)
Chvátal, V.: Some unknown van der Waerden numbers. In: Combinatorial Structures and their Applications Proceedings Calgary International Conference, Calgary, 1969, pp. 31–33. Gordon and Breach, New York (1970)
Deuber, W.: Partitionen und lineare Gleichungssysteme. Math. Z. 133, 109–123 (1973)
Deuber, W.: On van der Waerden’s theorem on arithmetic progressions. J. Comb. Theory A 32, 115–118 (1982)
Fredricksen, H.: Five sum-free sets. In: Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic University, Boca Raton, 1975). Congressus Numerantium, vol. XIV, pp. 309–314. Utilitas Mathematica, Winnipeg (1975)
Fredricksen, H.: Schur numbers and the Ramsey numbers N(3, 3, ⋯, 3; 2). J. Comb. Theory A 27, 376–377 (1979)
Furstenberg, H.: Recurrence in Ergodic Theory and Combinatorial Number Theory. M.B. Porter Lectures. Princeton University Press, Princeton (1981)
Furstenberg, H., Weiss, B.: Topological dynamics and combinatorial number theory. J. Anal. Math. 34, 61–85 (1978)
Gowers, W.: A new proof of Szemerédi’s theorem. Geom. Funct. Anal. 11, 465–588 (2001)
Graham, R.L.: Rudiments of Ramsey Theory. CBMS Regional Conference Series in Mathematics, vol. 45. American Mathematical Society, Providence (1981)
Graham, R.L., Rothschild, B.L.: Ramsey’s theorem for n-parameter sets. Trans. Am. Math. Soc. 159, 257–292 (1971)
Graham, R.L., Rothschild, B.L.: A short proof of van der Waerden’s theorem on arithmetic progressions. Proc. Am. Math. Soc. 42, 385–386 (1974)
Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. Wiley, New York (1980)
Hilbert, D.: Über die Irreducibilität ganzer rationaler Funktionen mit ganzzahligen Coefizienten. J. Reine Angew. Math. 110, 104–129 (1892)
Hindman, N.: Finite sums from sequences within cells of a partition of N. J. Comb. Theory A 17, 1–11 (1974)
Hindman, N.: Ultrafilters and combinatorial number theory. In: Number Theory, Carbondale, 1979. Proceedings of the Southern Illinois Number Theory Conference, pp. 119–184. Springer, Berlin (1979)
Irving, R.W.: An extension of Schur’s theorem on sum-free partitions. Acta Arith. 25, 55–64 (1973)
Khinchin, A.Y.: Three Pearls of Number Theory. Graylock, Rochester (1952)
Leeb, K.: A full Ramsey-theorem for the Deuber-category. In: Infinite and Finite Sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th Birthday), vol. II, pp. 1043–1049. North-Holland, Amsterdam (1975)
Nešetřil, J., Rödl, V.: Another proof of the Folkman-Rado-Sanders theorem. J. Comb. Theory A 34, 108–109 (1983a)
Prömel, H.J., Voigt, B.: A partition theorem for [0, 1]. Proc. Am. Math. Soc. 109, 281–285 (1990)
Rado, R.: Studien zur Kombinatorik. Math. Z. 36, 424–470 (1933a)
Rado, R.: Verallgemeinerung eines Satzes von van der Waerden mit Anwendungen auf ein Problem der Zahlentheorie. Sitzungsber. Preuß. Akad. Wiss. Phys.-Math. Klasse 17, 1–10 (1933b)
Rado, R.: Note on combinatorial analysis. Proc. Lond. Math. Soc. 48, 122–160 (1943)
Sanders, J.H.: A Generalization of Schur’s Theorem. Phd. Thesis, Yale University (1968)
Schur, I.: Über die Kongruenz \({x}^{m} + {y}^{m} = {z}^{m}\) (mod p). Jahresber. Dtsch. Math.-Verein. 25, 114–117 (1916)
Shelah, S.: Primitive recursive bounds for van der Waerden numbers. J. Am. Math. Soc. 1, 683–697 (1988)
Stevens, R.S., Shantaram, R.: Computer-generated van der Waerden partitions. Math. Comp. 32, 635–636 (1978)
Taylor, A.D.: Bounds for the disjoint unions theorem. J. Comb. Theory A 30, 339–344 (1981)
Taylor, A.D.: A note on van der Waerden’s theorem. J. Comb. Theory A 33, 215–219 (1982)
van der Waerden, B.L.: Beweis einer Baudetschen Vermutung. Nieuw Arch. Wisk. 15, 212–216 (1927)
van der Waerden, B.L.: Einfall und Überlegung in der Mathematik – Der Beweis der Vermutung von Baudet. Elem. Math. 9, 49–56 (1954)
van der Waerden, B.L.: How the proof of Baudet’s conjecture was found. In: Studies in Pure Mathematics (Presented to Richard Rado), pp. 251–260. Academic, London (1971)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Prömel, H.J. (2013). From Hilbert’s Cube Lemma to Rado’s Thesis. In: Ramsey Theory for Discrete Structures. Springer, Cham. https://doi.org/10.1007/978-3-319-01315-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-01315-2_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01314-5
Online ISBN: 978-3-319-01315-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)