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.
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.