竞赛图

An enumeration problem is solved for labeled consistent bipartite tournaments,and a sharp formula is obtained. 通过讨论，解决了标定一致二部竞赛图的计数问题，并获得了一个简明计算公式。

In this paper, we study the transitive properties of bipartite tournaments and tournaments, and give the sufficient and necessary conditions of them. 摘要研究了二部竞赛图和竞赛图的传递性，给出了它的充分必要条件。