OpenAI reports a linear-order hypercube Ramsey bound
- Mathematics
The two-color graph Ramsey number of the n-dimensional binary cube is at most C·2^n for one absolute constant C.
OpenAI reports a linear-order hypercube Ramsey bound
- Mathematics
The two-color graph Ramsey number of the n-dimensional binary cube is at most C·2^n for one absolute constant C.
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
The two-color graph Ramsey number of the n-dimensional binary cube is at most C·2^n for one absolute constant C.
Why it matters
If correct, resolves the Burr–Erdős hypercube Ramsey conjecture.
What counts as progress
Is the two-color Ramsey number of an n-dimensional cube O(2^n)?
Website timeline
Publication dates and editorial changes.