Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 173). A red–blue coloring of a Euclidean space is admissible if no two blue points are at distance one; an -coloring is proper if no color class contains two points at distance one; is the least for which has a proper -coloring. An -point configuration is a set of points of , and its translates are the sets .
An -coloring of with classes is regular (p. 174) if for some fixed vectors .
Proposition 2 (p. 174, quoted). "If can be properly -colored by a regular coloring, then there exists an admissible two-coloring of and an -point configuration so that translates of are forbidden in the red set."
The paper calls it a partial converse to Proposition 1, which bounds whenever an admissible coloring forbids red translates of an -point configuration (see Theorem 1's page).
Proof pointer
Section 2 (pp. 174--175). Normalize , take , color blue and everything else red. The blue set avoids distance one because the coloring is proper. The proof shows that the points of any translate lie in distinct classes, using and the identity ; with classes and points, one point lies in and is blue.
Read depth
Claims checked: the definition of a regular coloring, Proposition 2 and its proof were read clause by clause on the page images of the print. Nothing here is independently reviewed.
Dependencies
None.
Source. A. D. Szlam, Monochromatic translates of configurations in the plane, J. Combin. Theory Ser. A 93 (2001), 173--176, doi:10.1006/jcta.2000.3065; the edition read is named on the source card.
Bears on
- Problem 214: the proposition is the construction behind Theorem 2; it produces colorings that forbid red translates, not red congruent copies, and the paper draws no conclusion from it about the unit-square question.