Year: 2026
Type: preprint
Abstract: The Erd\H os--Sós Conjecture was recently proved by GPT-6 Astra, using a very ingenious and surprising argument. In this note, we present a simplified version of this argument in an (arguably) more natural form. We also prove a related conjecture of Addario-Berry, Havet, Linhares Sales, Reed and Thomassé, and give a substantially simplified proof of an analogous result for eulerian digraphs, again proved by GPT-6 Astra, and announced by Mubayi and Verstraete. In addition, we determine the extremal (di)graphs for all three problems.
Source: arXiv (Cornell University)
Authors: Riordan, Oliver, Scott, Alex
Institution: University of Oxford
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7213222530
