论文信息 - Tournaments whose Subtournaments are Irreducible or Transitive

Tournaments whose Subtournaments are Irreducible or Transitive

Abstract 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.

J. W. Moon

[1] L. Beineke,et al. The Maximum Number of Strongly Connected Subtournaments* , 1965, Canadian Mathematical Bulletin.

[2] John Riordan,et al. Introduction to Combinatorial Analysis , 1959 .

[3] P. Moran. On the method of paired comparisons. , 1947, Biometrika.