Cycles through a given Set of Vertices in Regular Multipartite Tournaments

Abstract

A tournament is an orientation of a complete graph, and in general a multipartite or c-partite tournament is an orientation of a complete c-partite graph. In a recent article, the authors proved that a regular c-partite tournament with r ≥ 2 vertices in each partite set contains a cycle with exactly r− 1 vertices from each partite set, with exception of the… (More)

Topics

2 Figures and Tables