ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Euclidean Ramsey sets

Ron Graham

Let XX be a finite set in En\mathbb{E}^n (nn-dimensional Euclidean space). We say that XX is Ramsey if for all positive integers rr there exists N=N(X,r)N = N(X,r) such that if one colors the points of EN\mathbb{E}^N with rr colors, then there exists a monochromatic set congruent to XX.

For example, if XX consist of two points, then XX is Ramsey. (Consider an rr-coloring of the 2r+12r+1 vertices of a unit simplex simplex in E2r\mathbb{E}^{2r}).

A set is spherical if it lies on some sphere.

Theorem. (Erd\H{o}s--Graham--Montgomery--Rothschild--Spencer--Straus). Every Ramsey set is spherical.

Conjecture. ($1000) Every finite spherical set is Ramsey.

A ``warm up'':

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.