A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Classification of finite Euclidean Ramsey configurations
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Egyptian Fractions <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:counting, coloring Levels:1
Category:Combinatorics Lean version:YES! ✔
Rate this game! 4.7 out of 5 (3,097 votes)

>>> How to Play <<<
Classification of finite Euclidean Ramsey configurations. Classifies finite point configurations that occur monochromatically, at their original scale, in every finite coloring of sufficiently high-dimensional Euclidean space. The characterization is an algebraic condition over the coordinate field. It also disproves the Leader–Russell–Walters conjecture that every such configuration is a subset of a finite transitive set.

>>> Level Select <<<
released 2026-09-23  |  1 theorem · 11 lemmas · 23 proofs · 11,246 words  |  PLAY LEVEL 1 »  (pdf)
We classify finite Euclidean Ramsey configurations by a necessary and sufficient tensor condition over their coordinate fields. The Ramsey property here concerns monochromatic congruent copies at the original scale under arbitrary finite colorings. The criterion shows that every nonempty subtransitive set and every nonempty set of at most five points on a circle is Ramsey. In particular, some Ramsey cyclic quadrilaterals are not subtransitive, disproving the necessity direction of the Leader–Russell–Walters conjectured characterization.

More Combinatorics Games!
Counterexamples to Sidorenko's conjecture and the forcing conjectureCounterexamples to Ryser's covering and Gyárfás's tree-cover conjecturesHindman's finite sums and products conjectureExact crossing numbers of complete and complete bipartite graphs
The higher-dimensional Erdős distinct-distances conjecturePinned distances and a power saving for planar unit distancesCombinatorial invariance of Kazhdan–Lusztig polynomialsThe Shareshian–Wachs $e$-positivity conjecture

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games