Erdős--Sós 猜想：GPT-6 Astra 所发现证明的可视化阐述
The Erdős--Sós Conjecture: A visual exposition of the proof discovered by GPT-6 Astra
浏览论文内容
中文总结 AI 辅助
该文可视化阐述GPT-6 Astra发现的Erdős--Sós定理简短计数证明，通过早期邻居、划分与可逆交换组织归纳，并给出多色Ramsey数推论。
中文摘要 AI 辅助
Erdős--Sós 定理指出，平均度大于 $t-2$ 的每个图都包含所有 $t$ 个顶点的树。2026年，GPT-6 Astra 发现了一个简短的计数证明。我们对该论证给出一个视觉化、以读者为中心的阐述，其呈现方式与原始版本有显著不同。我们将计数对象重新表述为“揭示并停止”过程中的“早期邻居”，通过显式划分和可逆交换来组织归纳，并通过一致绘图的工作示例来展开证明。我们还给出直接和概率性的结论，将此表述与其他近期阐述进行比较，并记录了树的多色 Ramsey 数的经典推论 $R(T;q)\le q(t-2)+2$。
英文摘要
The Erdős--Sós theorem states that every graph of average degree greater than $t-2$ contains every tree on $t$ vertices. A short counting proof was discovered by GPT-6 Astra in 2026. We give a visual, reader-centered exposition of that argument whose presentation differs substantially from the original. We recast the counting objects as \emph{early neighbors} in a reveal-and-stop procedure, organize the induction through explicit partitions and reversible swaps, and develop the proof through worked examples with consistent drawings. We also give direct and probabilistic conclusions, compare this formulation with other recent expositions, and record the classical consequence $R(T;q)\le q(t-2)+2$ for multicolor Ramsey numbers of trees.
发表机构
- Department of Mathematics and Statistics, California State University, Sacramento（加州州立大学萨克拉门托分校数学与统计系）
机构由 AI 辅助整理，请以论文原文为准。
