Maximum packings of the complete graph with uniform length cycles

In this paper we find the maximum number of pairwise edge-disjoint m-cycles which exist in a complete graph with n vertices, for all values of n and m with 3≤m≤n. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:1-7, 2011 © 2011 Wiley Periodicals, Inc.

[1]  Janie Ailor Kennedy.  Minimum coverings of Kn with hexagons , 1997, Australas. J Comb..

[2]  Alexander Rosa,et al.  Packing pentagons into complete graphs: how clumsy can you get? , 1994, Discret. Math..

[3]  Arie Bialostocki,et al.  Packing and Covering of the Complete Graph with 4-Cycles* , 1975, Canadian Mathematical Bulletin.

[4]  Saad El-Zanati.  Maximum packings with odd cycles , 1994, Discret. Math..

[5]  Brett Stevens.  The Anti-Oberwolfach Solution: Pancyclic 2- Factorizations of Complete Graphs , 2000, LATIN.

[6]  Peter Adams,et al.  3,5‐Cycle decompositions , 1998 .

[7]  Darryn Bryant.  Cycle decompositions of complete graphs , 2007 .

[8]  Brian Alspach,et al.  Cycle Decompositions of Kn and Kn-I , 2001, J. Comb. Theory, Ser. B.

[9]  Darryn Bryant,et al.  Cycle decompositions of complete multigraphs , 2009 .

[10]  Darryn Bryant,et al.  Decompositions of complete graphs into long cycles , 2009 .

[11]  Mateja Šajna.  Cycle decompositions III: Complete graphs and fixed length cycles , 2002 .

[12]  Darryn E. Bryant,et al.  Packing cycles in complete graphs , 2008, J. Comb. Theory, Ser. B.

[13]  Paul N. Balister.  On The Alspach Conjecture , 2001, Comb. Probab. Comput..

[14]  Darryn E. Bryant,et al.  An asymptotic solution to the cycle decomposition problem for complete graphs , 2010, J. Comb. Theory, Ser. A.

[15]  Darryn E. Bryant,et al.  Decompositions into 2-regular subgraph and equitable partial cycle decompositions , 2005, J. Comb. Theory, Ser. B.

[16]  Janie Ailor Kennedy.  Minimum coverings of K n with hexagons. , 1997 .