论文标题
计算及时锦标赛中的汉密尔顿路径
Counting Hamiltonian Paths in Transitive Tournaments
论文作者
论文摘要
我们构建了一个组合函数F，该功能在瞬时比赛中计算任何给定类型的定向哈密顿路径的数量。我们还研究了出现的F的许多属性，并进行了一些观察。
We construct a combinatorial function F which computes the number of oriented Hamiltonian paths of any given type, in a transitive tournament. We also study many properties of F that arise, and reach some observations.
