A tournament is a complete directed graph. Let $f(n)$ be such that every tournament on $n$ vertices contains a transitive tournament on $f(n)$ vertices (i.e. one such that if $i\to j\to k$ then $i\to k$).Is it true that $f(n)=\lfloor {\log }_{2}n\rfloor +1$?