Abstract
For all oddv ≥ 3 the complete graph onvK v vertices can be decomposed intov − 2 edge disjoint cycles whose lengths are 3, 3, 4, 5,...,v − 1. Also, for all oddv ≥ 7,K v can be decomposed intov − 3 edge disjoint cycles whose lengths are 3, 4,...,v − 4,v − 2,v − 1,v.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alspach, B.: Research problems. Discrete Math.36, 333 (1981)
Heinrich, K., Horak, P., Rosa, A.: On Alspach's conjecture. Discrete Math.77, 97–121 (1989)
Lindner, C.C., Rodger, C.A.: Decomposition into cycles II: Cycle systems in Contemporary design theory: a collection of surveys (J.H. Dintz and D.R. Stinson, eds.), John Wiley and Sons, New York (1992) 325–369
Lucas, E.: Récréations Mathématiques, Vol. 2, Gauthier-Villars, Paris (1892)
Rosa, A.: Alspach's conjecture is true forn ≤ 10. Math. Reports, McMaster University (to be published)
Author information
Authors and Affiliations
Additional information
Research supported by Australian Research Council grant A49130102
Rights and permissions
About this article
Cite this article
Bryant, D.E., Adams, P. Decomposing the complete graph into cycles of many lengths. Graphs and Combinatorics 11, 97–102 (1995). https://doi.org/10.1007/BF01929478
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01929478