Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T15:35:27.219Z Has data issue: false hasContentIssue false

On Subtournaments of a Tournament

Published online by Cambridge University Press:  20 November 2018

J. W. Moon*
Affiliation:
University of Alberta, Edmonton
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.

Beineke and Harary [l] recently showed that the maximum number of strong tournaments with k nodes that can be contained in a tournament with n nodes is

if 3 ≤ k ≤ n. The object of this note is to obtain some additional results of this type. We will use essentially the same terminology as was used in [ l ], so we will not repeat the standard definitions here.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1966