A proof of Sumner's universal tournament conjecture for large tournaments
Combinatorics
2015-09-15 v1
Abstract
Sumner's universal tournament conjecture states that any tournament on vertices contains any directed tree on vertices. In this paper we prove that this conjecture holds for all sufficiently large . 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.
Cite
@article{arxiv.1010.4430,
title = {A proof of Sumner's universal tournament conjecture for large tournaments},
author = {Daniela Kühn and Richard Mycroft and Deryk Osthus},
journal= {arXiv preprint arXiv:1010.4430},
year = {2015}
}
Comments
39 pages. To appear in Proceedings of the London Mathematical Society