Geodesic
Tournaments whose Subtournaments are Irreducible or Transitive
Canadian mathematical bulletin, Tome 22 (1979) no. 1, pp. 75-79

Voir la notice de l'article provenant de la source Cambridge University Press

Beineke and Harary gave an example of a family of tournaments Tn such that every subtournament of Tn is irreducible or transitive. We characterize all tournaments with this property. 
Moon, J. W. Tournaments whose Subtournaments are Irreducible or Transitive. Canadian mathematical bulletin, Tome 22 (1979) no. 1, pp. 75-79. doi: 10.4153/CMB-1979-010-7
@article{10_4153_CMB_1979_010_7,
     author = {Moon, J. W.},
     title = {Tournaments whose {Subtournaments} are {Irreducible} or {Transitive}},
     journal = {Canadian mathematical bulletin},
     pages = {75--79},
     year = {1979},
     volume = {22},
     number = {1},
     doi = {10.4153/CMB-1979-010-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-010-7/}
}
TY  - JOUR
AU  - Moon, J. W.
TI  - Tournaments whose Subtournaments are Irreducible or Transitive
JO  - Canadian mathematical bulletin
PY  - 1979
SP  - 75
EP  - 79
VL  - 22
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-010-7/
DO  - 10.4153/CMB-1979-010-7
ID  - 10_4153_CMB_1979_010_7
ER  - 
%0 Journal Article
%A Moon, J. W.
%T Tournaments whose Subtournaments are Irreducible or Transitive
%J Canadian mathematical bulletin
%D 1979
%P 75-79
%V 22
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-010-7/
%R 10.4153/CMB-1979-010-7
%F 10_4153_CMB_1979_010_7

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

[2] 2. Beineke, L. W. and Wilson, R. J., A survey of recent results on tournaments, Recent Advances in Graph Theory, Academia Praha, 1975, 31-48. Google Scholar

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

[4] 4. Moon, J. W., Topics on Tournaments, Holt, Rinehart, and Winston, New York, 1968. Google Scholar

[5] 5. Riordan, J., An Introduction to Combinatorial Analysis, Wiley, New York, 1958. Google Scholar

[6] 6. Varlet, J. C., Convexity in tournaments, Bull. Soc. Roy. Sci. Liège, 45 (1976), 570-586. Google Scholar

Cité par Sources :