Combinatorial Relations and Chromatic Graphs

  • Greenwood R
  • Gleason A
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Greenwood, R. E., & Gleason, A. M. (1955). Combinatorial Relations and Chromatic Graphs. Canadian Journal of Mathematics, 7, 1–7. https://doi.org/10.4153/cjm-1955-001-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free