Skip to main content
Log in

Large Sets of Almost Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this paper, we give necessary and sufficient conditions for the existence of large sets of almost Hamilton cycle decompositions of \(\lambda K_{m,n}\). We also give necessary and sufficient conditions for the existence of large sets of almost Hamilton path decompositions of \(\lambda K_{n,n}\).

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

Access this article

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. Bryant, D.: Large sets of hamilton cycle and path decompositions. Congr. Numer. 135, 147–151 (1998)

    MathSciNet  MATH  Google Scholar 

  2. Kang, Q.: A generalization of Mendelsohn triple systems. Ars Comb. 29C, 207–215 (1990)

    MathSciNet  MATH  Google Scholar 

  3. Kang, Q., Zhang, Y.: Large set of \(P_3\)-decompositions. J. Comb. Des. 10, 151–159 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kang, Q., Zhao, H.: Large sets of Hamilton cycle decompositions of complete bipartite graphs. Eur. J. Comb. 29, 1492–1501 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lu, J.: On large sets of disjoint Steiner triple systems I-III. J. Comb. Theory Ser. A 34, 140–182 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  6. Lu, J.: On large sets of disjoint Steiner triple systems IV-VI. J. Comb. Theory Ser. A 37, 136–192 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Teirlinck, L.: A completion of Lu’s determination of the spectrum for large sets of disjoint Steiner triple systems. J. Comb. Theory Ser. A 57, 302–305 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  8. Zhang, Y.: On large set of \(P_k\)-decompositions. J. Comb. Des. 13, 462–465 (2005)

    Article  MATH  Google Scholar 

  9. Zhao, H., Kang, Q.: Large sets of Hamilton cycle and path decompositions. Discrete Math. 308, 4931–4940 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Zhao, H., Kang, Q.: On large sets of almost Hamilton cycle decompositions. J. Comb. Des. 16, 53–69 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Zhao, H., Kang, Q.: Large sets of Hamilton cycle and path decompositions of complete bipartite graphs. Graphs Comb. 29(1), 145–155 (2013)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The authors would like to thank the referees for their careful reading of the paper and helpful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongtao Zhao.

Additional information

Research supported by NSFC Grant (10901051,11201143), the Fundamental Research Funds for the Central Universities (No.13MS38) and the Co-construction Project of Bejing Municipal Commission of Education.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, H., Kang, Q. Large Sets of Almost Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs. Graphs and Combinatorics 31, 2481–2491 (2015). https://doi.org/10.1007/s00373-014-1513-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-014-1513-2

Keywords

Mathematics Subject Classification

Navigation