An n-partite tournament is an orientation of a complete n-partite graph. In 1976, Bendy raised the following problem: does every strong n-partite (n greater than or equal to 5) tournament, in which each partite set has at least two vertices, contain an (n + 1) - cycle? It is the purpose of this paper to give a characterization of all such n-partite tournaments without (n + 1)-cycle. (C) 1996 Academic Press, Inc. [References: 5]
展开▼
