For a tournament $H$ with $h$ vertices, its typical density is $h!2^{-\binom{h}{2}}/aut(H)$, i.e. this the expected of in random tournament. A family ${\mathcal F}$ $h$-vertex tournaments {\em dominant} if for all sufficiently large $n$, there exists an $n$-vertex $G$ such that each element larger than by constant factor. Characterizing dominant families challenging already small $h$. Here we c...
