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.