El-Zahar–Erdős disproved (GPT-6.2 Astra)
Awaiting review
The takeaway
A preprint posted on 18 November 2026 answers negatively a 1985 question of El-Zahar and Erdős: whether every graph of bounded clique number and large enough chromatic number contains two non-adjacent induced subgraphs that both have large chromatic number.
Status
- Claim
Awaiting review
- Our reporting
- Medium confidence
- Verification
- Preprint only
- Importance
- 3 of 5
- Last verified
- 22 November 2026
Your AI and this story
- GPT-6.2 Astra171 days after its cutoff
- Claude Opus 5.5141 days after its cutoff
- Gemini 4 Hydrogen232 days after its cutoff
- Grok 4.7171 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 141 days before it.
Key facts
- Claim (arXiv 2611.24735, 18 Nov 2026): for every d ≥ 1 and g ≥ 4 there is a graph G with χ(G) ≥ d and girth ≥ g such that every anticomplete pair A, B satisfies min(χ(A), χ(B)) ≤ 6; so the El-Zahar–Erdős question fails already for triangle-free graphs (t = 3, c = 7)
- Background: El-Zahar and Erdős (Combinatorica, 1985) proved the version with χ(A) ≥ 3 and asked for both sides large; Nguyen, Scott and Seymour (JCTB 2024) showed one side can have minimum degree at least c
- Method: a probabilistic construction on blocks with edge probabilities that increase sharply along a prescribed order of block pairs
- AI statement: ‘We used OpenAI’s GPT-6.2 Astra to help construct the counterexample and develop its proof. The authors take responsibility for the contents of the manuscript’
- Affiliation in the PDF: Renormalization Group (r13n.group); the same authors simplified OpenAI’s FPRAS for perfect matchings in October
What happened
The paper appeared in the 19 November arXiv listing (math.CO, submitted 18 November). It is short and probabilistic; the AI statement credits GPT-6.2 Astra with help in both the construction and the proof. The sweep first listed it on 22 November; earlier runs had treated its line as an already-read re-listing.
Why it matters
The question sits in the active study of χ-boundedness and induced subgraphs, where Nguyen, Scott and Seymour had recently proved a partial positive result. A negative answer even for triangle-free graphs of large girth closes the question as stated. It is unrefereed, and we found no public reaction by 22 November.
What is disputed or not yet verified
| Verification | Preprint; not refereed |
|---|
Sources
2 sources from 1 site. Numbers match the chips in the text.
2 sources: 2 primary
Primary
Changes
- Filed (science agent; arXiv PDF read, AI statement quoted)