Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-29T10:48:13.837Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Score Sequence of an N-Partite Tournament

Published online by Cambridge University Press:  20 November 2018

J.W. Moon
J.W. Moon*
Affiliation:
University of Alberta
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let there be given n(≥l) distinct sets of points Pi=(Pi1,…, Pini), 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.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 5 , Issue 1 , January 1962 , pp. 51 - 58
Copyright
Copyright © Canadian Mathematical Society 1962

References

1. Gale, D., "A theorem on flows in networks," Pac. J. Math., 7(1957), 1073-1082.Google Scholar
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. Roy, B., Sur quelques propriétés des graphes fortement connexes," C. R. Acad. Sci. Paris, 249 (1959), 2151-2152.Google Scholar
4. Ryser, H. J., "Combinatorial properties of matrices of 0's and 1's," Can. J. Math. 9 (1957), 371-377.Google Scholar