Unavoidable trees in tournaments

Richard Mycroft, Tássio Naia

An oriented tree $T$ on $n$ vertices is unavoidable if every tournament on $n$ vertices contains a copy of $T$. In this paper we give a sufficient condition for $T$ to be unavoidab…