Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

The number of \(6\)-cycles in \(2\)-factorizations of \(K_n\), \(n\) odd

Peter Adams1, Elizabeth J.Billington1, C.C. Lindner2
1 Centre for Discrete Mathematics and Computing, Department of Mathematics, The University of Queensland, Queensland 4072 Australia
2Department of Discrete and Statistical Sciences 120 Math Annex Auburn University Auburn Alabama 36849-5307 U.S.A.
  • Published: 31/05/2002

Abstract

In this paper, we construct \(2\)-factorizations of \(K_n\) (\(n\) odd) containing a specified number, \(k\), of \(6\)-cycles, for all integers \(k\) between 0 and the maximum possible expected number of \(6\)-cycles in any \(2\)-factorization, and for all odd \(n\), with no exceptions.

Citation
Peter Adams, Elizabeth J.Billington, C.C. Lindner. The number of \(6\)-cycles in \(2\)-factorizations of \(K_n\), \(n\) odd[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 041. 223-243. .