Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. The paragraph on p. 45 of P. Erdős, Combinatorial problems in geometry, Math. Chronicle 12 (1983), 35--54, the transcript of an invited address at the 17th New Zealand Mathematics Colloquium (Dunedin, 17--19 May 1982), as named on the source card. The lecture numbers none of its statements; the pages are the journal's own.
Statement
Definition (p. 45). A finite set in some Euclidean space is Ramsey if for every there is an , depending only on and , such that whenever the points of -dimensional space are divided into classes, some class contains a set congruent to . The lecture stresses congruent, not merely similar.
Reported results (p. 45), from the papers of Erdős, Graham, Montgomery, Rothschild, Spencer and Straus:
- The unit square is Ramsey; for two colours, fifteen points in -dimensional space suffice, in that every -colouring of them has a monochromatic unit square.
- Every brick (rectangular parallelepiped), in any number of dimensions, is Ramsey.
- Every Ramsey set lies on a sphere.
Erdős says these are the only general theorems known.
Question (p. 45). Is the isosceles triangle with one angle and the others Ramsey: is it true that for large enough there is a finite set in -dimensional space such that every division of it into classes has a class containing a triangle congruent to this one? Erdős calls it the simplest unsolved problem of the subject.
Read depth. Claims checked: the passage was read clause by clause on the page images of the print. A second reader checked the statement, hypotheses, label and page against the print.
Proof pointer
The paper proves none of these; it cites the three joint papers, one in the Journal of Combinatorial Theory (1973) and two in the proceedings of the Keszthely meeting.
Dependencies
None.
Bears on
- Problem 174: background. The problem asks for a characterization of the Ramsey sets; the lecture reports the necessary condition (lying on a sphere), two sufficient classes (the unit square, the bricks) and an open triangle case, and proves nothing new.