Sumner万有竞赛猜想的一个近似形式
An approximate version of Sumner's universal tournament conjecture
摘要:
萨姆纳的普适竞赛图猜想指出,任何$2n-2$顶点上的竞赛图都包含任何$n$顶点上的有向树的副本。我们证明了这个猜想的一个渐近版本,即$(2+o(1))n$顶点上的任何竞赛包含$n$顶点上的任何有向树的副本。此外,我们证明了一个渐近最好的可能结果,即对于任何固定的$Δ$,任何竞赛的$(1+o(1))n$顶点包含一个副本的任何有向树的最大程度上$Δ$的$n$顶点。
英文摘要:
Sumner's universal tournament conjecture states that any tournament on $2n-2$ vertices contains a copy of any directed tree on $n$ vertices. We prove an asymptotic version of this conjecture, namely that any tournament on $(2+o(1))n$ vertices contains a copy of any directed tree on $n$ vertices. In addition, we prove an asymptotically best possible result for trees of bounded degree, namely that for any fixed $Δ$, any tournament on $(1+o(1))n$ vertices contains a copy of any directed tree on $n$ vertices with maximum degree at most $Δ$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。