发表机构
Emory University（埃默里大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文基于 GPT-6 Astra 的近期工作，用随机循环排序简化证明了 Erdős-Sós 猜想，并给出了有向图反定向树猜想的另一证明。
AI 中文摘要
我们给出了关于图中树的 Erdős-Sós 猜想的一个简化证明，该证明基于 GPT-6 Astra 最近对该猜想的解决。同时，我们也对由 Addario-Berry、Havet、Linhares Sales、Reed 和 Thomassé 提出的有向图中反定向树的相应猜想给出了另一个证明。我们的证明使用随机循环排序的语言，以利用原始论证中被掩盖的对称性，我们希望读者会觉得它直观易懂。
英文摘要
We present a simplified proof of the Erdős-Sós Conjecture on trees in graphs, which is based on its recent resolution by GPT-6 Astra. At the same time, we also give another proof of the corresponding conjecture for antidirected trees in digraphs, posed by Addario-Berry, Havet, Linhares Sales, Reed, and Thomassé. Our proof uses the language of random cyclic orderings in order to take advantage of symmetries that were obscured in the original argument, and we hope that the reader will find it intuitive.
Comments6 pages, 3 figures
