Skip to main content
SpringerLink
Log in

Packing 5-cycles into balanced complete m-partite graphs for odd m

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Let \(K_{n_{1},n_{2},\ldots,n_{m}}\) be a complete m-partite graph with partite sets of sizes n 1,n 2,…,n m . A complete m-partite graph is balanced if each partite set has n vertices. We denote this complete m-partite graph by K m(n). In this paper, we completely solve the problem of finding a maximum packing of the balanced complete m-partite graph K m(n), m odd, with edge-disjoint 5-cycles and we explicitly give the minimum leaves.

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

Access this article

Log in via an institution

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

  • Alspach B, Gavlas H (2001) Cycle decompositions of K n and K n −I. J Comb Theory Ser B 81:77–99

    Article  MATH  Google Scholar 

  • Alspach B, Marshall S (1994) Even cycle decompositions of complete graphs minus a 1-factor. J Comb Des 2:441–458

    Article  MATH  Google Scholar 

  • Billington EJ, Fu H-L, Rodger CA (2001) Packing complete multipartite graphs with 4-cycles. J Comb Des 9:107–127

    Article  MATH  Google Scholar 

  • Billington EJ, Fu H-L, Rodger CA (2005) Packing λ-fold complete multipartite graphs with 4-cycles. Graphs Comb 21:169–185

    Article  MATH  Google Scholar 

  • Cavenagh NJ, Billington EJ (2000b) On decomposing complete tripartite graphs into 5-cycles. Australas J Comb 22:41–62

    MATH  Google Scholar 

  • Lindner CC, Rodger CA (1992) Decomposition into cycle II: cycle systems. In: Dinitz JH, Stinson DR (eds) Contemporary design theory: a collection of surveys. Wiley, New York, pp 325–369

    Google Scholar 

  • Rosa A, Znám S (1994) Packing pentagons into complete graphs: how clumsy can you get. Discrete Math 128:305–316

    Article  MATH  Google Scholar 

  • Wilson RM (1974) Some partitions of all triples into Steiner triple systems. In: Lecture notes in mathematics, vol 411. Springer, Berlin, pp 267–277

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, Yuanpei Institute of Science and Technology, Hsinchu, Taiwan

    Ming-Hway Huang

  2. Department of Mathematics, Tamkang University, Tamsui, Taipei Shien, Taiwan

    Chin-Mei Fu

  3. Department of Applied Mathematics, National Chiao Tung University, Hsinchu, Taiwan

    Hung-Lin Fu

Authors
  1. Ming-Hway Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chin-Mei Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hung-Lin Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chin-Mei Fu.

Additional information

Dedicated to Professor Frank K. Hwang on the occasion of his 65th birthday.

Research of M.-H.W. was supported by NSC 93-2115-M-264-001.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, MH., Fu, CM. & Fu, HL. Packing 5-cycles into balanced complete m-partite graphs for odd m . J Comb Optim 14, 323–329 (2007). https://doi.org/10.1007/s10878-007-9049-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-007-9049-5

Keywords

Search

Navigation