A proof of Sumner's universal tournament conjecture for large tournaments
Daniela Kühn, Richard Mycroft, Deryk Osthus · Proceedings of the London Mathematical Society · 2010
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.