Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 7, p. 568, with its proof and Figure 3, pp. 568--569, of P. Erdős, R. L. Graham, P. Montgomery, B. L. Rothschild, J. Spencer and E. G. Straus, Euclidean Ramsey Theorems, III, Infinite and Finite Sets (Keszthely 1973), Colloq. Math. Soc. János Bolyai 10, North-Holland (1975), 559--583, as identified on the source card.
Statement
Theorem 7 (p. 568). Let be a two-coloring of . Let be a triple with angles , where is allowed (the triple then degenerates to a pair), and let be a triple with angles and the same hypotenuse length as .
- If holds, then holds when for some integers , .
- If some has its two hypotenuse vertices of one color and its third vertex of the other, then holds if .
- If such a exists, then there is a triangle , with the same hypotenuse length, whose vertex is colored opposite to the other two, if .
The second and third statements print no range for , . The paper calls this the "roulette method" (p. 568).
Proof pointer
Pp. 568--569. On the circle with diameter , like-colored at the hypotenuse distance , if fails the points obtained by turning through the angle at and alternate in color (Figure 3, p. 569); when the stated relation holds, the third vertex of the given copy of lands on one of them with the wrong color. The other statements run the same way.
Read depth. Claims checked: the statement was read clause by clause on p. 568; the proof was read for its structure only.
Used by. Theorem 17 and Theorems 18 and 19 (p. 576).
Bears on
- Problem 173: a conditional tool that moves monochromatic right triangles between angles within a fixed coloring; through Theorem 17 it gives for right triangles with an angle a rational multiple of . It decides no triangle by itself.