SeokbeomKim

Given a tournament $S$, a tournament is $S$-free if it has no subtournament isomorphic to $S$. Until now, there have been only a small number of tournaments $S$ such that the complete structure of $S$-free tournaments is known. Let $\mathrm{△}(1,2,2)$ be a tournament obtained from the cyclic triangle by substituting two-vertex tournaments for …