大型竞赛图的Sumner万有竞赛图猜想的一个证明
A proof of Sumner's universal tournament conjecture for large tournaments
摘要：
Sumner的普适竞赛图猜想指出，任何$2n-2$顶点上的竞赛图都包含任何$n$顶点上的有向树。在本文中，我们证明了这一猜想成立的所有充分大的$n$。证明广泛使用的结果和想法，从最近的论文由同一作者，其中一个近似版本的猜想被证明。
英文摘要：
Sumner's universal tournament conjecture states that any tournament on $2n-2$ vertices contains any directed tree on $n$ vertices. In this paper we prove that this conjecture holds for all sufficiently large $n$. The proof makes extensive use of results and ideas from a recent paper by the same authors, in which an approximate version of the conjecture was proved.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
