競(jìng)賽圖

An enumeration problem is solved for labeled consistent bipartite tournaments,and a sharp formula is obtained. 通過(guò)討論，解決了標(biāo)定一致二部競(jìng)賽圖的計(jì)數(shù)問(wèn)題，并獲得了一個(gè)簡(jiǎn)明計(jì)算公式。

In this paper, we study the transitive properties of bipartite tournaments and tournaments, and give the sufficient and necessary conditions of them. 摘要研究了二部競(jìng)賽圖和競(jìng)賽圖的傳遞性，給出了它的充分必要條件。