Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-15T06:46:41.389Z Has data issue: false hasContentIssue false
  • English
  • Français

Cycles of Each Length in Regular Tournaments

Published online by Cambridge University Press:  20 November 2018

Brian Alspach
Brian Alspach*
Affiliation:
Simon Fraser University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 10 , Issue 2 , June 1967 , pp. 283 - 286
Copyright
Copyright © Canadian Mathematical Society 1967

References

1. Harary, F. and Moser, L., The theory of round robin tournaments. Amer. Math. Monthly, 73 (1966), 231-246.Google Scholar
2. Moon, J. W., On sub tournaments of a tournament. Canad. Math. Bull., 9 (1966), 297-301.Google Scholar