Abstract
Ramsey theory studies, generally speaking, the following problem: Suppose that a given structure is colored using finitely many colors (equivalently, partition into finitely many pieces). Which combinatorial configurations can be found that are monochromatic, i.e. consisting of elements of the same color (equivalently, entirely contained in one of the pieces)? Ramsey’s theorem from 1930, which we will present in this chapter, can be seen as the foundational result in this area. While remarkably simple to state, it has a large number of important consequences and applications. Many of these applications were studied by Erdős and Rado in the 1950s, who “rediscovered” Ramsey’s theorem and recognized it importance. Attempts to generalize Ramsey’s theorem in different contexts and directions have been one of the main driving forces in Ramsey theory.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A. Blass, Selective ultrafilters and homogeneity. Ann. Pure Appl. Logic 38(3), 215–255 (1988)
P. Cholak, G. Igusa, L. Patey, M. Soskova, D. Turetsky, The rado path decomposition theorem. arXiv:1610.03364 (2016)
R. Rado, Monochromatic paths in graphs. Ann. Discrete Math. 3, 191–194 (1978)
F.P. Ramsey, On a problem of formal logic. Proc. Lond. Math. Soc. S2-30(1), 264 (1930)
S. Todorcevic, Introduction to Ramsey Spaces. Annals of Mathematics Studies, vol. 174 (Princeton University Press, Princeton, 2010)
T. Trujillo, From abstract alpha-Ramsey theory to abstract ultra-Ramsey theory. arXiv:1601.03831 [math] (2016)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Nasso, M.D., Goldbring, I., Lupini, M. (2019). Ramsey’s Theorem. In: Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory. Lecture Notes in Mathematics, vol 2239. Springer, Cham. https://doi.org/10.1007/978-3-030-17956-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-17956-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-17955-7
Online ISBN: 978-3-030-17956-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)