Title of article
A proof of Sumnerʼs universal tournament conjecture for large tournaments
Author/Authors
Osthus، نويسنده , , Deryk and Kühn، نويسنده , , Daniela and Mycroft، نويسنده , , Richard، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
687
To page
692
Abstract
Sumnerʼs universal tournament conjecture from 1971 states that any tournament on 2 n − 2 vertices contains any directed tree on n vertices. We prove that this conjecture holds for all sufficiently large n.
Keywords
tournaments , trees
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2011
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455927
Link To Document