Geodesic
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 University Press

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/}
}
TY  - JOUR
AU  - Moon, J. W.
TI  - On Subtournaments of a Tournament
JO  - Canadian mathematical bulletin
PY  - 1966
SP  - 297
EP  - 301
VL  - 9
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-038-7/
DO  - 10.4153/CMB-1966-038-7
ID  - 10_4153_CMB_1966_038_7
ER  - 
%0 Journal Article
%A Moon, J. W.
%T On Subtournaments of a Tournament
%J Canadian mathematical bulletin
%D 1966
%P 297-301
%V 9
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-038-7/
%R 10.4153/CMB-1966-038-7
%F 10_4153_CMB_1966_038_7

[1] 1. Beineke, L. W. and Harary, F., The maximum number of strongly connected sub tournaments, Canad. Math. Bull, vol. 8 (1965), 491-498. Google Scholar

[2] 2. Camion, P., Chemins et circuits hamiltoniens des graphs complets, C. R. Acad. Sci. Paris 249 (1959), 2151-2152. Google Scholar

[3] 3. Colombo, U., Sui circuiti nei grafi completi, Boll. Un. Mat. Ital. 19 (1964), 153-170. Google Scholar

[4] 4. Erdős, P. and Moser, L., On the representation of directed graphs as unions or orderings, Publi. Math. Inst. Hung. Acad. Sci. 9 (1964), 125-132. Google Scholar

[5] 5. Harary, F., Norman, R. and Cartwright, D., Structural Models: An Introduction to the Theory of Directed Graphs (New York, 1965). Google Scholar

[6] 6. Kendall, M.G. and Babington Smith, B., On the method of paired comparisons, Biometrika 31 (1940), 324-345. Google Scholar

[7] 7. Szele, T., Kombinatorische Untersuchungen űber den gerichteten vollstandigen Graphen, Mat. Fiz. Lapok 50 (1943), 223-256. Google Scholar

Cité par Sources :