Trees in tournaments

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.