Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-27T12:13:08.510Z Has data issue: false hasContentIssue false
  • English
  • Français

Tournaments whose Subtournaments are Irreducible or Transitive

Published online by Cambridge University Press:  20 November 2018

J. W. Moon
J. W. Moon*
Affiliation:
Department of MathematicsUniversity of the Witwatersrand Johannesburg2001South Africa
Rights & Permissions [Opens in a new window]

Abstract

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.

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.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 22 , Issue 1 , 01 March 1979 , pp. 75 - 79
Copyright
Copyright © Canadian Mathematical Society 1979

References

1. Beineke, L. W. and Harary, F., The maximum number of strongly connected subtoumaments, Canad. Math. Bull. 8 (1965), 491-498.Google Scholar
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. Kendall, M. G. and Smith, B.Babington, On the method of paired comparisons, Biometrika 31 (1940), 324-345.Google Scholar
4. Moon, J. W., Topics on Tournaments, Holt, Rinehart, and Winston, New York, 1968.Google Scholar
5. Riordan, J., An Introduction to Combinatorial Analysis, Wiley, New York, 1958.Google Scholar
6. Varlet, J. C., Convexity in tournaments, Bull. Soc. Roy. Sci. Liège, 45 (1976), 570-586.Google Scholar