竞赛图中Hamilton路数的一个下界(英文)

A Lower Bound of the Number of HamiltonPath for Tournament

假设T是一个竞赛图,T1,T2,…,Ts(s≥1)是T的所有强连通分支.本文通过考虑每个Ti的入度序列给出了T中Hamilton路数的一个下界.

Let T be a tournament, and T-1,T-2,:,T-s(s≥1) be the strong components of T. Though considering the in-degree sequence of T-i, for every i∈{1,2,:,s}, this paper gives a lower bound of the number of Hamilton path for tournament T.