Cycle systems in the complete bipartite graph plus a one-factor
Date of Issue2008
School of Physical and Mathematical Sciences
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n+I denote Kn,n with a one-factor added. It is proved in this paper that there exists an m-cycle system of Kn,n + I if and only if n ≡ 1 (mod 2), m ≡ 0 (mod 2), 4 ≤ m ≤ 2n, and n(n + 1) ≡ 0 (mod m).
SIAM Journal of discrete math
©2008 Society for Industrial and Applied Mathematics This paper was published in SIAM J Discrete Math and is made available as an electronic reprint (preprint) with permission of Society for Industrial and Applied Mathematics.The paper can be found at http://dx.doi.org/10.1137/06065461X. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.