Canadian Mathematical Bulletin · 1967 · 73 citations · 2 references
Natural SciencesMathematicsCombinatoricsComputational GeometryGame TheoryCombinatorial Game TheoryDirected Acyclic GraphsArc CombinatoricsTournaments Theory
It is known that a strong tournament of order n contains a cycle of each length k, k=3,…, n, ([l], Thm. 7). Moon [2] observed that each vertex in a strong tournament of order n is contained in a cycle of each length k, k = 3,…, n. In this paper we obtain a similar result for each arc of a regular tournament, that is, a tournament in which all vertices have the same score.
2
On Subtournaments of a Tournament
J. W. Moon · Canadian Mathematical Bulletin · 1966 · 151 citations · Full text
The Theory of Round Robin Tournaments
Frank Harary, Leo Moser · American Mathematical Monthly · 1966 · 144 citations