A proof of Sumner's universal tournament conjecture for large tournaments

Abstract

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

DOI: 10.1016/j.endm.2011.10.015

Extracted Key Phrases

Cite this paper

@article{Osthus2011APO, title={A proof of Sumner's universal tournament conjecture for large tournaments}, author={Deryk Osthus and Daniela K{\"{u}hn and Richard Mycroft}, journal={Electronic Notes in Discrete Mathematics}, year={2011}, volume={38}, pages={687-692} }