On Cycles Containing a Given Arc in Regular Multipartite Tournaments

被引：0

作者：

Lin Qiang Pan

Ke Min Zhang

机构：

[1] Huazhong University of Science and Technology,Department of Control Science and Engineering

[2] Nanjing University,Department of Mathematics

来源：

Acta Mathematica Sinica | 2004年 / 20卷

关键词：

Multipartite tournaments; Cycles; 05C20;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In this paper we prove that if T is a regular n-partite tournament with n ≥ 4, then each arc of T lies on a cycle whose vertices are from exactly k partite sets for k = 4, 5, . . . ,n. Our result, in a sense, generalizes a theorem due to Alspach.

引用

页码：379 / 384

页数：5

共 10 条

[1]

Moon undefined(1966)undefined Canad. Math. Bull. 9 297-undefined

[2]

Alspach undefined(1967)undefined Canad. Math. Bull. 10 283-undefined

[3]

Goddard undefined(1991)undefined Graph Theory Combinat. Appl. 1 525-undefined

[4]

Guo undefined(1994)undefined J. Combin. Theory Ser. B 62 363-undefined

[5]

Guo undefined(1999)undefined Discrete Appl. Math. 95 273-undefined

[6]

Gutin undefined(1993)undefined J. Combin. Theory Ser. B 58 319-undefined

[7]

Yeo undefined(1999)undefined Graph Theory 32 137-undefined

[8]

Gutin undefined(1995)undefined J. Graph Theory 19 481-undefined

[9]

Volkmann undefined(2002)undefined Disrecte Math. 245 19-undefined

[10]

Zhou undefined(2002)undefined Acta Mathematicae Applicatae Sinica 18 681-undefined

← 1 →