On Subtournaments of a Tournament
Canadian mathematical bulletin, Tome 9 (1966) no. 3, pp. 297-301
Voir la notice de l'article provenant de la source Cambridge
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.
Moon, J. W. On Subtournaments of a Tournament. Canadian mathematical bulletin, Tome 9 (1966) no. 3, pp. 297-301. doi: 10.4153/CMB-1966-038-7
@article{10_4153_CMB_1966_038_7,
author = {Moon, J. W.},
title = {On {Subtournaments} of a {Tournament}},
journal = {Canadian mathematical bulletin},
pages = {297--301},
year = {1966},
volume = {9},
number = {3},
doi = {10.4153/CMB-1966-038-7},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-038-7/}
}
Cité par Sources :