HN
login
AI proof of the Erdős–Sós conjecturearxiv.org

We present an exposition of a proof, discovered by GPT-6 Astra, of the Erdős--Sós Conjecture, which states that every graph with average degree greater than $t-2$ contains every tree on $t\geq 2$ vertices.

6 points•tadamcz•8 days ago•0 comments•
#proof#conjecture#erd#ai#ai proof#every#exposition#present

0 comments

No comments yet.

Related stories