Cycles of Each Length in Regular Tournaments
- 1 June 1967
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 10 (2) , 283-286
- https://doi.org/10.4153/cmb-1967-028-6
Abstract
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.Keywords
This publication has 2 references indexed in Scilit:
- On Subtournaments of a TournamentCanadian Mathematical Bulletin, 1966
- The Theory of Round Robin TournamentsThe American Mathematical Monthly, 1966