A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
The hypercube Ramsey conjecture
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Gaussian Moat Hopper <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, we can't help you. No Lean version yet. Some unformalized games could have issues!
expertly designed by an internal OpenAI model

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

>>> How to Play <<<
The hypercube Ramsey conjecture. Resolves the Burr–Erdős hypercube Ramsey conjecture: the two-color Ramsey number of the n-dimensional cube is $\Theta(2^n)$. Thus every red-blue coloring of a complete graph on a universal constant times the cube's number of vertices contains a monochromatic copy of the cube.

>>> Level Select <<<
released 2026-09-23  |  1 theorem · 36 lemmas · 55 proofs · 85,176 words  |  PLAY LEVEL 1 »  (pdf)
We prove that the two-color Ramsey number of the n-dimensional binary cube is at most $C2^n$, where C is an absolute constant. This resolves positively the hypercube Ramsey conjecture of Burr and Erdős.

More Combinatorics Games!
Counterexamples to infinite matroid intersection and packing/coveringThe Friedgut–Kalai graph and hypergraph threshold conjecturesSnaky in 21 Maker moves PLAYABLE!The sharp constant in random triangle removal
Exact cycle–clique Ramsey numbersPolynomial removal fails for ordered binary matricesA power improvement in the Heilbronn triangle problemA counterexample to the Gopalan–Servedio conjecture

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