Complementary Cycles in Irregular Multipartite Tournaments

A tournament is a directed graph obtained by assigning a direction for each edge in an undirected complete graph. A digraph is cycle complementary if there exist two vertex disjoint cycles and such that . Let be a locally almost regular -partite tournament with and such that all partite sets have the same cardinality , and let be a -cycle of . In this paper, we prove that if has no cycle factor, then contains a pair of disjoint cycles of length and , unless is isomorphic to , , , or .

from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2aTopBa
via IFTTT