Abstract
Many questions in Ramsey Theory can be placed in the following context. We are given a set X, a family F of distinguished subsets of X, and a positive integer r. We would like to decide whether or not the following statement holds: For any partition of X = X 1 ∪…∪ X r into r classes, there is an F ∈ F and an index i such that F ⊆ X i .
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
Preview
Unable to display preview. Download preview PDF.
References
Erdos, P., Rothschild, B., Straus, E.G. (1983): Polychromatic Euclidean Ramsey theorems. J. Geom. 20, 28–35
Erdos, P., Graham, R.L., Montgomery, P., Rothschild, B., Spencer, J., Straus, E.G. (1973): Euclidean Ramsey theorems I. J. Comb. Theory, Ser. A 14, 341–363
Erdos, P., Graham, R.L., Montgomery, P., Rothschild, B., Spencer, J., Straus, E.G. (1975): Euclidean Ramsey theorems II. In: Hajnal, A., Rado, R., Sos, V. (eds.): Infinite sets I. North Holland, Amsterdam, pp. 529–557 (Colloq. Math. Soc. Janos Bolyai, Vol. 10)
Erdos, P., Graham, R.L., Montgomery, P., Rothschildm B., Spencer, J., Straus, E.G. (1975): Euclidean Ramsey theorems III. In: Hajnal, A., Rado, R., Sos, V. (eds.): Infinite and finite sets II. North Holland, Amsterdam, pp. 559–583 (Colloq. Math. Soc. Janos Bolyai, Vol. 10)
Frankl, P., Rodl, V. (1986): All triangles are Ramsey. Trans. Am. Math. Soc. 297, 777–779
Frankl, P., Rodl, V.: A partition property of simplices in Euclidean space, (to appear) Frankl, P., Wilson, R.M. (1981): Intersection theorems with geometric consequences.
Combinatorica 1, 357-368 Graham, R.L. (1980): On partitions of En. J. Comb. Theory, Ser. A 28, 89–97
Graham, R.L. (1980): On partitions of En. J. Comb. Theory, Ser. A 28, 89–97
Graham, R.L. (1981): Rudiments of Ramsey theory. American Mathematical Society, Providence, RI (CBMS Reg. Conf. Ser. Math., Vol. 45 )
Graham, R.L. (1983): Euclidean Ramsey theorems on the n-sphere. J. Graph Theory 7, 105–114
Graham, R.L., Rothschild, B., Spencer, J. (1980): Ramsey theory. J. Wiley & Sons, New York, NY
Rado, R. (1933): Studien zur Kombinatorik. Math. Z. 36, 424–480
Shader, L.E. (1974): Several Euclidean Ramsey theorems. In: Hoffman, F., Kingsley, R.A., Levow, R.B., Mullin, R.C., Thomas, R.S.D. (eds.): Proc. 5th Southeastern Conference on Combinatorics, Graph Theory and Computing. Utili- tas Mathematica, Winnipeg, pp. 615–623 ( Congr. Numerantium, No. X )
Shader, L.E. (1976): All right triangles are Ramsey in E2! J. Comb. Theory, Ser. A 20, 385–389
Straus, E.G. (1975): A combinatorial theorem in group theory. Math. Comput. 29, 303–309
Wormald, N. (1979): A 4-chromatic graph with a special plane drawing. J. Aust. Math. Soc., Ser. A 28, 1–8
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Graham, R.L. (1990). Topics in Euclidean Ramsey Theory. In: Nešetřil, J., Rödl, V. (eds) Mathematics of Ramsey Theory. Algorithms and Combinatorics, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72905-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-72905-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72907-2
Online ISBN: 978-3-642-72905-8
eBook Packages: Springer Book Archive