Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Published pp. 360–362, Theorem 25 (published scan).
Statement. Let . If cannot be contained in at most concentric spheres, then it is not -Ramsey for every integer , in the source's few-color convention. There is one finite color count, independent of ambient dimension, for which every congruent copy uses at least colors.
Complete proof. First assume finite. Consider each partition of into at most nonempty classes. There are finitely many such partitions. In each class choose an anchor and form its pairs with every other point in that class. A point equidistant across all these pairs would be the common center of at most spheres covering , contrary to the hypothesis. Therefore lemma_27 supplies a finite radial coloring which prevents any congruent copy from making all classes of this particular partition monochromatic.
Take the product of these finitely many colorings. Its number of colors depends only on and , not on the ambient dimension. If a copy used at most product colors, pull its color classes back to a partition of . Every such class would also be monochromatic for the coordinate , contradicting that coordinate's defining property. Hence every copy uses at least colors.
For in any fixed finite-dimensional Euclidean space, possibly infinite, finite_sphere_obstruction gives a finite subset that still does not fit in concentric spheres. Apply the finite result to . Every congruent copy of contains a congruent copy of , so the same coloring works for .
Endpoint. The source states , not . In particular the case gives the necessary sphericity condition for -Ramsey sets; it does not say that a nonspherical set cannot be -Ramsey.
Bears on. #174.