pancyclic
... that every round-robin tournament either has a set of players who win all games against players outside the set, or its graph of wins and losses is pancyclic, having directed cycles of all lengths?
... that every <a href="./Round-robin_tournament" id="mwEhY" rel="mw:WikiLink" title="Round-robin tournament">round-robin tournament</a> either has a set of players who win all games against players outside the set, or its <a href="./Tournament_(graph_theory)" id="mwEhc" rel="mw:WikiLink" title="Tournament (graph theory)">graph of wins and losses</a> is <b id="mwEhg"><a href="./Pancyclic_graph" id="mwEhk" rel="mw:WikiLink" title="Pancyclic graph">pancyclic</a></b>, having <a class="mw-redirect" href="./Directed_cycle" id="mwEho" rel="mw:WikiLink" title="Directed cycle">directed cycles</a> of all lengths?