Transitive partitions in realizations of
โ
Arthur H. Busch; Guantao Chen; Michael S. Jacobson
๐
Article
๐
2009
๐
John Wiley and Sons
๐
English
โ 121 KB
## Abstract A tournament is an oriented complete graph, and one containing no directed cycles is called __transitive__. A tournament __T__=(__V, A__) is called __m__โ__partition transitive__ if there is a partition such that the subtournaments induced by each __X__~__i__~ are all transitive, an