Hostname: page-component-7dd5485656-pnlb5 Total loading time: 0.001 Render date: 2025-10-31T18:13:17.053Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  22 September 2016

M. Lewin
M. Lewin*
Affiliation:
Department of Mathematics, Technion, Haifa, Israel
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Notes
Information
The Mathematical Gazette , Volume 60 , Issue 412 , June 1976 , pp. 136 - 138
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.)

Article purchase

Temporarily unavailable

References

1. Erdös, P. and Szekeres, G., A combinatorial problem in geometry, Compositie math. 2, 463–470 (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, 264–286 (1930).CrossRefGoogle Scholar