Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-28T07:10:58.261Z Has data issue: false hasContentIssue false
  • English
  • Français

On maximal transitive subtournaments

Published online by Cambridge University Press:  20 January 2009

J. W. Moon
J. W. Moon
Affiliation:
Mathematical Institute, Oxford
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.

A tournamentTn consists of a finite set of nodes1, 2, …, n such that each pair of distinct nodes i and j is joined by exactly one of the arcsij or ji. If the arc ij is in Tn we say that i beats j or j loses to i and write i→j. If each node of a subtournament A beats each node of a subtournament B we write A→B and let A + B denote the tournament determined by the nodes of A and B.

Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 17 , Issue 4 , December 1971 , pp. 345 - 349
Copyright
Copyright © Edinburgh Mathematical Society 1971

References

REFERENCES

(1) Moon, J. W., Topics on Tournaments (Holt, New York, 1968).Google Scholar
(2) Pólya, G. u. Szeo*ouml;, G., Aufgaben und Lehrsätze aus der Analysis, I (Springer, Berlin, 1925).Google Scholar