Not evaluated
Exact cycle–clique Ramsey numbers (family 189)
The gist
On October 6, 2026, OpenAI announced a manuscript on cycle-clique Ramsey numbers, from an unreleased internal model.
DiscoverIA status on October 12, 2026: not evaluated, meaning no third-party evaluation found.
AI draft, not reviewedWhat has not been reviewed?
Text written by an AI (DiscoverIA pipeline), on . The status and its sources come from the registry; only the explanatory text has not been reviewed. A reported error is corrected, then the text is reviewed.
Cite this entry
A single status snapshot since Oct 12, 2026: a citation always points to a dated snapshot.
Cite snapshot 1, Oct 12, 2026
APA citation with the dated link
BibTeX @misc, key discoveria-oai-fam-189-exact-cycleclique-ramsey-numbers-r1
@misc{discoveria-oai-fam-189-exact-cycleclique-ramsey-numbers-r1,
author = {{DiscoverIA}},
title = {Exact cycle–clique Ramsey numbers (family 189)},
howpublished = {DiscoverIA registry, entry oai-fam-189-exact-cycleclique-ramsey-numbers},
note = {Status “Not evaluated”, snapshot 1, recorded on October 12, 2026. New result},
year = {2026},
url = {https://discoveria.ai/entry/oai-fam-189-exact-cycleclique-ramsey-numbers#releve-1},
urldate = {2026-10-12}
}Dated link opens this snapshot in the history
To understand ≈ 30 s reading time, estimated
What it changes
If the manuscript were correct, it would bring, according to its title, a result on Ramsey numbers between a cycle and a clique. A cycle is a closed loop of vertices, and a clique is a group of vertices all joined in pairs. The corresponding Ramsey number is the smallest number of vertices such that, when all links are coloured with two colours, there is always a cycle of the first colour or a clique of the second.
What remains unclear
The Lean (a language in which a computer checks every step of a proof) was supplied by OpenAI itself, and its tracking file formalization.yaml marks it “unchecked”. No third-party verification is recorded, and the sources read do not say for which cycle and clique sizes a result is claimed.
For experts
Sources, method, key facts, status history, report an error
Status
Not evaluated
Recorded on · github.com · 189.md
Step 1 of 4 on the scale: not evaluated. Next step: under review.
- Announced
- Recordednot evaluated
- nextTo follow
What this status means
Source reading : Source read word for word (level 3 of 3)
The result is declared neither right nor wrong.
To move to “Under review”: a public review under way. To “Peer reviewed”: a journal publication or a review by named experts.
Sources
- Main sourcegithub.com · CONTENTS.mdlink only, reading not recorded
- Repositorygithub.com · Cycle-clique-Ramsey…link only, reading not recorded
- Lean proofgithub.com · 189.mdpage read word for word
- Lean proofgithub.com · CycleCliqueRamsey.leanlink only, reading not recorded
Method
The openai/math repository contains one manuscript, “Cycle--clique Ramsey numbers”, dated September 25, 2026 and filed under the section “Combinatorics” (overview.tex). The file lean/docs/189.md describes the scope of the Lean formalisation, with 1 Comparator statement (lean/ComparatorChallenges/CycleCliqueRamsey.lean). In formalization.yaml, the family is not among the listed sources; history.md reports no revision of this manuscript. DiscoverIA status: not evaluated, meaning that no third-party evaluation has been found in the sources read. Set on October 12, 2026 from github.com (page read, quotation checked word for word: “describes the scope of the Lean formalization”).
Limits
No named third party: the recorded checks come from the claimant or from a platform tool. The claimant supplies a Lean proof; as of this date, DiscoverIA has found no independent verification of this proof or of the result.
Key facts
- Claimed by
- OpenAI (unreleased internal model)
announced on Oct 6, 2026 - Nature
- new result
- Field
- Mathematics (Combinatorics)
- In openai/math
- family 189, section “Combinatorics”, 1 manuscript dated Sep 25, 2026
- Lean proof
- supplied by the claimant, marked “unchecked” (not reviewed) in its repository
- Revisions
- none reported by the claimant
- Checked by
- claimant (Lean supplied, not checked by a third party)
- Sources
- 4 : 1 read word for word, 3 links only
- This entry
- AI draft, not reviewed
Status history
Only one observation so far.
- 01
First observation:Not evaluatedCurrent status
Family with a Lean proof supplied by the claimant. No third-party check read; the source marks this proof as not reviewed (“unchecked”).
Source: github.comread word for word
An observation is added; none is ever erased.
In the same set
openai/math: 719 manuscripts in 372 families from an unreleased internal model · entry 183 of 372, by family number
- Not evaluated : The Friedgut–Kalai graph and hypergraph threshold conjectures (family 186)
- Not evaluated : Snaky in 21 Maker moves (family 187)
- Not evaluated : The sharp constant in random triangle removal (family 188)
- Not evaluated : Exact cycle–clique Ramsey numbers (family 189)
- Not evaluated : Polynomial removal fails for ordered binary matrices (family 190)
- Not evaluated : A power improvement in the Heilbronn triangle problem (family 191)
- Not evaluated : A counterexample to the Gopalan–Servedio conjecture (family 192)
Report an error or suggest a source
Thank you, your message was sent.
Sending failed. Try again, or write to contact@discoveria.ai.
Is your result listed?What each status requires, correcting this entry, replying to it.