Abstract
For all m ≥ 3 the edges of complete graph on 2m + 1 vertices can he partitioned into m 2m-cycles and an m-cycle.
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.U. Dinitz and D.R. Stinson, eds.) New York: John Wiley and Sons 1992 pp. 325–369
Rosa, A.: Alspach’s conjecture is true for n ≤ 10, Math. Reports, McMaster University (to be published)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by Australian Research Council grants A49130102 and A49532477
Rights and permissions
About this article
Cite this article
Bryant, D.E. 2m-Cycle Systems of K 2m+1\C m . Graphs and Combinatorics 13, 227–229 (1997). https://doi.org/10.1007/BF03352999
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03352999