Structure Theorem for<i>U</i><sub>5</sub>-free Tournaments
Structure Theorem for<i>U</i><sub>5</sub>-free Tournaments
Let U5 be the tournament with vertices v1, …, v5 such that , and if , and . In this article, we describe the tournaments that do not have U5 as a subtournament. Specifically, we show that if a tournament G is “prime”—that is, if there is no subset , …