科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期2011-4
