What was already known
Burr and Erdős asked whether hypercubes form a graph family with Ramsey number linear in vertex count. The cube lies at a natural density boundary for such families.
AI involvement
OpenAI credits itself as manuscript author and states that its internal frontier model produced the results in this release. Individual human input is not detailed enough to establish task-only autonomy.
OpenAI is named as author on the manuscript, and its release attributes the results to an internal frontier model. The individual human input is not detailed enough to establish autonomy.
Importance
Resolves the Burr–Erdős hypercube Ramsey conjecture.
Limitations
The claim is for two colors and ordinary graph copies of the binary cube; no multicolor or induced-copy bound is asserted. No completed proof check was documented in the available sources.
Technical verification
Reported is the default when evidence for a higher level is insufficient. The OpenAI-authored manuscript reports and argues the result, but the reviewed sources do not document a completed check of the full assessed claim.
Human understanding
Few is the default when evidence for a higher level is insufficient. No named person is documented as explaining the central argument for this assessed contribution.
Correction and publication history
Primary manuscript, attribution, and prior-work review for non-notifying local inclusion; technical check remains undocumented.
Read this published revision