Combinatorics · Oct 6, 2026
The hypercube Ramsey conjecture
Resolves the Burr–Erdős hypercube Ramsey conjecture: the two-color Ramsey number of the n-dimensional cube is . 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.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model