ON DECOMPOSITIONS OF THE COMPLETE EQUIPARTITE GRAPHS Kkm(2t) INTO GREGARIOUS m-CYCLES

초록

For an even integer m at least 4 and any positive integer t, it is shown that the complete equipartite graph Kkm(2t) can be decomposed into edge-disjoint gregarious m-cycles for any positive integer k under the condition satisfying (m-1)2+34m < k. Here it will be called a gregarious cycle if the cycle has at most one vertex from each partite set.

키워드