GPT-6 Astra proves a linear coloring bound for graphs excluding clique minors
The authors present a proof of the Linear Hadwiger conjecture: there is a constant C such that every graph with no K_t minor is colorable with at most Ct colors. GPT-6 Astra developed the proof after the authors directed it to the dense case and then asked it to bridge existing bounds; the resulting proof combines several known frameworks with a new bootstrap argument. The result is an asymptotic linear bound, not the stronger Hadwiger conjecture χ(G)≤h(G).
Technology: OpenAI GPT-6 Astra (described in the paper as ChatGPT model Astra 6)
Family GPT-6: profile · models page
Publication: Preprint · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: direct test
- Tested: The authors present a proof of the Linear Hadwiger conjecture: there is a constant C such that every graph with no K_t minor is colorable with at most Ct colors.
- Still unknown: The result is an arXiv preprint and is not the full Hadwiger conjecture. It proves existence of an absolute linear-coloring constant for K_t-minor-free graphs. The authors take responsibility for the proof; Independent formal verification was not assessed in the source review.
- AI role: Authors disclose that the proof was developed by the model following their research directions and feedback; the model supplied a new bootstrap argument after being prompted first on a dense case and then to bridge existing bounds. Authors independently wrote the exposition, reviewed the result and take responsibility for correctness.
Evidence sources: https://arxiv.org/abs/2610.05291
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: paper. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 4/5 · Validation 3/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.