CYCLES IN MULTIPARTITE TOURNAMENTS

Authors
Citation
Yb. Guo et L. Volkmann, CYCLES IN MULTIPARTITE TOURNAMENTS, J COMB TH B, 62(2), 1994, pp. 363-366
Citations number
5
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN journal
00958956 → ACNP
Volume
62
Issue
2
Year of publication
1994
Pages
363 - 366
Database
ISI
SICI code
0095-8956(1994)62:2<363:CIMT>2.0.ZU;2-D
Abstract
An n-partite tournament is an orientation of a complete n-partite grap h. We show that if D is a strongly connected n-partite (n greater than or equal to 3) tournament, then every partite set of D has at least o ne vertex, which lies on an m-cycle for all m in {3, 4,..., n}. This r esult extends those of Bendy (J. London Math. Sec. 14 (1976), 277-282) and Gutin (J. Combin. Theory Ser. B 58 (1993), 319-321). (C) 1994 Aca demic Press, Inc.