Projects per year
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 proved.
Original language  English 

Pages (fromto)  731766 
Number of pages  36 
Journal  London Mathematical Society. Proceedings 
Volume  102 
DOIs  
Publication status  Published  1 Apr 2011 
Fingerprint
Dive into the research topics of 'A proof of Sumner's universal tournament conjecture for large tournaments'. Together they form a unique fingerprint.Projects
 1 Finished

Directed graphs and the regularity method
Engineering & Physical Science Research Council
1/10/07 → 31/03/11
Project: Research Councils