Geodesic
On the Score Sequence of an N-Partite Tournament
Canadian mathematical bulletin, Tome 5 (1962) no. 1, pp. 51-58

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

Let there be given n(≥l) distinct sets of points Pi=(Pi1,..., Pin i), with ni≥1, for i=1,..., n. If joining each pair of points not in the same set is a line oriented towards one, and only one, point of the pair the resulting configuration will be called an n-partite tournament. If the line joining Pij and Pkl is oriented towards the latter point we shall indicate this by Pij →Pkl, and similarly if the orientation is in the opposite sense. 
Moon, J.W. On the Score Sequence of an N-Partite Tournament. Canadian mathematical bulletin, Tome 5 (1962) no. 1, pp. 51-58. doi: 10.4153/CMB-1962-008-9
@article{10_4153_CMB_1962_008_9,
     author = {Moon, J.W.},
     title = {On the {Score} {Sequence} of an {N-Partite} {Tournament}},
     journal = {Canadian mathematical bulletin},
     pages = {51--58},
     year = {1962},
     volume = {5},
     number = {1},
     doi = {10.4153/CMB-1962-008-9},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1962-008-9/}
}
TY  - JOUR
AU  - Moon, J.W.
TI  - On the Score Sequence of an N-Partite Tournament
JO  - Canadian mathematical bulletin
PY  - 1962
SP  - 51
EP  - 58
VL  - 5
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1962-008-9/
DO  - 10.4153/CMB-1962-008-9
ID  - 10_4153_CMB_1962_008_9
ER  - 
%0 Journal Article
%A Moon, J.W.
%T On the Score Sequence of an N-Partite Tournament
%J Canadian mathematical bulletin
%D 1962
%P 51-58
%V 5
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1962-008-9/
%R 10.4153/CMB-1962-008-9
%F 10_4153_CMB_1962_008_9

[1] 1. Gale, D., "A theorem on flows in networks," Pac. J. Math., 7(1957), 1073-1082. Google Scholar

[2] 2. Landau, H. G., "On dominance relations and the structure of animal societies: III. The condition for a score structure," Bull. Math. Biophysics, 15(1953), 143-148. Google Scholar

[3] 3. Roy, B., Sur quelques propriétés des graphes fortement connexes," C. R. Acad. Sci. Paris, 249 (1959), 2151-2152. Google Scholar

[4] 4. Ryser, H. J., "Combinatorial properties of matrices of 0's and 1's," Can. J. Math. 9 (1957), 371-377. Google Scholar

Cité par Sources :