A note on the number of Hamiltonian paths in strong tournaments

被引：0

作者：

Busch, AH ^{[1
]}

机构：

[1] Lehigh Univ, Dept Math, Bethlehem, PA 18105 USA

来源：

ELECTRONIC JOURNAL OF COMBINATORICS | 2006年 / 13卷 / 01期

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1/3. A known construction shows this number is best possible when n equivalent to 1 mod 3 and gives similar minimal values for n congruent to 0 and 2 modulo 3.

引用

页数：4