Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Conjectures 2 and 3 and the passage between them, p. 560; the reformulations on pp. 564 and 565; 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
Conjecture 2 (p. 560), as posed: "If is 2-colored so that there is no equilateral triangle of side , then there is a monochromatic equilateral triangle of side , for ." The hypothesis is read with "monochromatic" understood, as the surrounding text and the reformulation on p. 565 show: the paper restates Conjecture 2 as saying that for some , or , so the conclusion is for every .
Conjecture 3 (p. 560), as posed: "If is a triangle which is not equilateral, then is true."
The notation , and is that of Theorem 1. The paper derives Conjecture 3 from Conjecture 2 through Theorem 1 and states that the two are equivalent in view of Theorem 1 (p. 560); it restates Conjecture 3 as for every two-coloring (p. 564). It notes (p. 582) that it would suffice to prove Conjecture 3 for the non-equilateral isosceles triangles, and that it has no -triangle with and transcendental.
Status in the paper
Posed, not proved. The paper proves for several families of triangles (Theorem 9, Corollary 10, Corollary 15, Theorem 17), shows that the exceptional set is totally disconnected (Theorem 5), and shows that minimal finite witnesses for the -triangle grow without bound as (Theorem 28).
Bears on
- Problem 173: Conjecture 2 is the problem's statement in the paper's terms, that a two-coloring misses at most one triangle (which must then be equilateral), and Conjecture 3 is equivalent to it by Theorem 1. The page poses the question and settles it for no coloring.