On Subtournaments of a Tournament
- 1 August 1966
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 9 (3) , 297-301
- https://doi.org/10.4153/cmb-1966-038-7
Abstract
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.Keywords
This publication has 2 references indexed in Scilit:
- The Maximum Number of Strongly Connected Subtournaments*Canadian Mathematical Bulletin, 1965
- ON THE METHOD OF PAIRED COMPARISONSBiometrika, 1940