GPT-6 Astra finds a counting proof of the Erdős–Sós tree-embedding conjecture
A counting argument proves that every finite graph with average degree greater than t−2 contains every tree on t vertices, resolving the Erdős–Sós conjecture. The proof counts adjacency-marked vertex orderings and uses an induction on the tree to bound those not supporting a rooted copy. The exposition states the sharp classical theorem and records its proof was discovered by GPT-6 Astra; a Lean repository checks the benchmark formalization of the result. Related expository papers of the same proof are aliases, not separate discoveries.
Technology: Pre-release OpenAI GPT-6 Astra in the FrontierMath Erdős benchmark
Family GPT-6: profile · models page
Publication: Preprint · Test context: prospective or independent check. 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: prospective or independent check
- Tested: A counting argument proves that every finite graph with average degree greater than t−2 contains every tree on t vertices, resolving the Erdős–Sós conjecture.
- Still unknown: The arXiv paper is an exposition of the proof, not the original benchmark output. The linked Lean proof is machine-checked against the benchmark formalization; the registry notes a minor parity-case difference in that compared statement, while the paper’s counting lemma derives the sharp classical average-degree threshold. This remains a preprint and the formalization is not independently audited here.
- AI role: GPT-6 Astra autonomously found the counting proof while solving Erdős problem 548 in the FrontierMath Erdős benchmark; the exposition author reports the discovery and lays out the proof. A Lean 4 repository states the proof was machine-checked by a Comparator against the benchmark’s formal statement.
Evidence sources: https://arxiv.org/abs/2609.17877
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 4/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.