Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-14T05:01:03.878Z Has data issue: false hasContentIssue false
  • English
  • Français

A Note on Ramsey's Theorem

Published online by Cambridge University Press:  20 November 2018

H. L. Abbott
H. L. Abbott*
Affiliation:
University of Alberta, Edmonton, Alberta
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Other
Information
Canadian Mathematical Bulletin , Volume 15 , Issue 1 , March 1972 , pp. 9 - 10
Copyright
Copyright © Canadian Mathematical Society 1972

References

1. Erdös, P. and Rado, R., A partition calculus in set theory, Bull. Amer. Math. Soc. 62 (1956), 427-89.Google Scholar
2. Erdös, P. and Szekeres, G., A combinatorial problem in geometry, Compositio Math. 2 (1935), 463-470.Google Scholar
3. Erdös, P., Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292-294.Google Scholar
4. Greenwood, R. E. and Gleason, A. M., Combinatorial relations and chromatic graphs, Canad. J. Math. 7 (1955), 1-17.Google Scholar
5. Ramsey, F. P., On a problem informal logic, Proc. Londo. Math. Soc. 30 (1930), 264-286.Google Scholar
6. Erdös, P. and Szemeredi, E., On a Ramsey type theorem (to appear).Google Scholar