Skip to main content
Log in

2m-Cycle Systems of K 2m+1\C m

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alspach, B.: Research problems. Discrete Math. 36, 333 (1981)

    Article  MathSciNet  Google Scholar 

  2. Heinrich, K., Horak, P., Rosa, A.: On Alspach’s conjecture. Discrete Math. 77, 97–121 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. 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

  4. Rosa, A.: Alspach’s conjecture is true for n ≤ 10, Math. Reports, McMaster University (to be published)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Darryn E. Bryant.

Additional information

Research supported by Australian Research Council grants A49130102 and A49532477

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03352999

Keywords

Navigation