Proceedings of the Edinburgh Mathematical Society (Series 2)

Research Article

On maximal transitive subtournaments

J. W. Moona1

a1 Mathematical Institute, Oxford

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

(Received March 11 1971)

Footnotes

† On leave from the University of Alberta.