Cycles of the given length in multipartite tournaments

Jie Zhang, Zhilan Wang, Jin Yan

Published 2022-06-22Version 1

Let c be an integer. A c-partite tournament is an orientation of a complete c-partite graph. In this paper, we characterize the structure of all strong c-partite (c>7) tournaments without (c+2)-cycle such that each partite set has at least two vertices. Our result extends a theorem of Guo and Volkmann [J. Combin. Theory Ser. B 66 (1996) 140-145].