Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-22T01:25:37.616Z Has data issue: false hasContentIssue false
  • English
  • Français

Combinatorial Relations and Chromatic Graphs

Published online by Cambridge University Press:  20 November 2018

R. E. Greenwood  and
A. M. Gleason
R. E. Greenwood
Affiliation:
University of Texas
A. M. Gleason
Affiliation:
Harvard University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

1. Introduction. The following elementary logical problem was a question in the William Lowell Putnam Mathematical Competition held in March 1953 (1): Six points are in general position in space (no three in a line, no four in a plane). The fifteen line segments joining them in pairs are drawn, and then painted, some segments red, some blue. Prove that some triangle has all its sides the same color.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 7 , 1955 , pp. 1 - 7
Copyright
Copyright © Canadian Mathematical Society 1955

References

1. Bush, L. E., The William Lowell Putnam Mathematical Competition, Amer. Math. Monthly, 60 (1953), 539–542.Google Scholar
2. Vandiver, H. S., Fermat's Last Theorem, Amer. Math. Monthly, 53 (1946), 555–578.Google Scholar
3. Dickson, L. E., History of the theory of numbers, Carnegie Institution of Washington, 2, 763.Google Scholar