The Erdős--Sós Theorem

2026-09-15

AI Summary

该文利用GPT-6 Astra发现的证明方法，解决了Erdős–Sós猜想，即平均度大于t-2的图包含所有t个顶点的树。

Abstract

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.

Problem

• Erdős–Sós Conjecture
• graph
• average degree
• tree

Innovation

• GPT-6 Astra
• Erdős–Sós Conjecture
• graph theory