Title of article
Trees in tournaments
Author/Authors
Amine El Sahili، نويسنده , , A.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
5
From page
183
To page
187
Abstract
In 1971, Sumner conjectured that any tournament of order 2(n−1) contains any oriented tree of order n. Since then several bounds have been established that get closer and closer to the suggested bound 2(n−1). In this paper we prove that any tournament of order 3(n−1) contains any oriented tree of order n.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2004
Journal title
Journal of Combinatorial Theory Series B
Record number
1527486
Link To Document