A general Ramsey product theorem
HTML articles powered by AMS MathViewer
- by R. L. Graham and J. H. Spencer PDF
- Proc. Amer. Math. Soc. 73 (1979), 137-139 Request permission
Abstract:
Call a family $\mathcal {F}$ of subsets of a set U Ramsey if no partition of U into finitely many parts can split every $F \in \mathcal {F}$. We show that under very general conditions an arbitrary collection of Ramsey families in fact has a much stronger uniform Ramsey property.References
- N. G. de Bruijn and P. Erdös, A colour problem for infinite graphs and a problem in the theory of relations, Nederl. Akad. Wetensch. Proc. Ser. A. 54 = Indagationes Math. 13 (1951), 369–373. MR 0046630
- R. L. Graham and B. L. Rothschild, A short proof of van der Waerden’s theorem on arithmetic progressions, Proc. Amer. Math. Soc. 42 (1974), 385–386. MR 329917, DOI 10.1090/S0002-9939-1974-0329917-8
- Richard Rado, Studien zur Kombinatorik, Math. Z. 36 (1933), no. 1, 424–470 (German). MR 1545354, DOI 10.1007/BF01188632 B. L. van der Waerden, Beweis einer Baudetschen Vermutung, Nieuw Arch. Wisk. 15 (1927), 212-216.
Additional Information
- © Copyright 1979 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 73 (1979), 137-139
- MSC: Primary 05C55
- DOI: https://doi.org/10.1090/S0002-9939-1979-0512076-0
- MathSciNet review: 512076