Wiki
Wiki

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 ff be a two-coloring of E2E^2. Let KαK_\alpha be a triple with angles 90∘,α,90∘−α90^\circ,\alpha,90^\circ-\alpha, where α=0\alpha=0 is allowed (the triple then degenerates to a pair), and let KβK_\beta be a triple with angles 90∘,β,90∘−β90^\circ,\beta,90^\circ-\beta and the same hypotenuse length as KαK_\alpha.

  • If Rf(Kα)R_f(K_\alpha) holds, then Rf(Kβ)R_f(K_\beta) holds when (2m+1)β=α+n⋅180∘(2m+1)\beta=\alpha+n\cdot180^\circ for some integers m≥0m\ge0, n≥0n\ge0.
  • If some Kα′≅KαK'_\alpha\cong K_\alpha has its two hypotenuse vertices of one color and its third vertex of the other, then Rf(Kβ)R_f(K_\beta) holds if 2mβ=α+n⋅180∘2m\beta=\alpha+n\cdot180^\circ.
  • If such a Kα′K'_\alpha exists, then there is a triangle Kβ′K'_\beta, with the same hypotenuse length, whose 90∘90^\circ vertex is colored opposite to the other two, if mβ=α+n⋅180∘m\beta=\alpha+n\cdot180^\circ.

The second and third statements print no range for mm, nn. The paper calls this the "roulette method" (p. 568).

Proof pointer

Pp. 568--569. On the circle with diameter xyxy, x,yx,y like-colored at the hypotenuse distance cc, if Rf(Kβ)R_f(K_\beta) fails the points obtained by turning through the angle β\beta at xx and yy alternate in color (Figure 3, p. 569); when the stated relation holds, the third vertex of the given copy of KαK_\alpha 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 R(K)R(K) for right triangles with an angle a rational multiple of 180∘180^\circ. It decides no triangle by itself.