Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-24T14:27:13.832Z Has data issue: false hasContentIssue false

60.13 A New Proof of a Theorem of Erdös and Szekeres

Published online by Cambridge University Press:  22 September 2016

M. Lewin*
Affiliation:
Department of Mathematics, Technion, Haifa, Israel

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes
Copyright
Copyright © Mathematical Association 1976

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Erdös, P. and Szekeres, G., A combinatorial problem in geometry, Compositie math. 2, 463470 (1935).Google Scholar
2. Hall, M., Combinatorial theory. Blaisdell, Waltham (1967).Google Scholar
3. Ramsey, F. P., On a problem of formal logic, Proc. Land. math. Soc. 2nd series 30, 264286 (1930).CrossRefGoogle Scholar