Skip to main content
SpringerLink
Log in

On the Existence of Resolvable (K 3 + e)-Group Divisible Designs

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

Abstract

In this paper, it is shown that the necessary conditions for the existence of resolvable (K 3 + e)-group divisible designs with group-type g u are also sufficient.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abel R.J.R., Bennett F.E., Greig M.: PBD-closure. In: Colbourn, C.J., Dinitz, J.H. (eds) CRC Handbook of Combinatorial Designs 2nd edn, pp. 247–255. Chapman & Hall/CRC, Boca Raton (2007)

    Google Scholar 

  2. Colbourn C.J., Dinitz J.H.: CRC Handbook of Combinatorial Designs, 2nd edn, pp. 160–162. Chapman & Hall/CRC, Boca Raton (2007)

    MATH  Google Scholar 

  3. Colbourn C.J., Ling A.C.H., Quattrocchi G.: Minimum embedding of P 3-designs into (K 4−e)-designs. J. Combin. Des. 11, 352–366 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Danziger P., Mendelsohn E., Quattrocchi G.: Resolvable decompositions of λ K n into the union of two 2-paths. Ars Combin. 93, 33–49 (2009)

    MathSciNet  Google Scholar 

  5. Furino S.C., Miao Y., Yin J.X.: Frames and Resolvable Designs: Uses, Constructions and Existence, pp. 107–121. CRC Press, Boca Raton (1996)

    MATH  Google Scholar 

  6. Ge G., Ling A.C.H.: On the existence of resolvable (K 4−e)-designs. J. Combin. Des. 15, 502–510 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ge G., Ling A.C.H.: Asymptotic results on the existence of 4-RGDDs and uniform 5-GDDs. J. Combin. Des. 13, 222–237 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Rees R.S.: Two new direct product-type constructions for resolvable group-divisible designs. J. Combin. Des. 1, 15–26 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Wang H., Chang Y.: Kite-group divisible designs of type g t u 1. Graphs Combin. 22, 545–571 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Wang L., Su R.: On the existence of maximum resolvable (K 4−e)-packings. Discrete Math. 310, 887–896 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  11. Yu M.: On path factorizations of complete multipartite graphs. Discrete Math. 122, 325–333 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Basic Courses, Chinese People’s Armed Police Force Academy, Langfang, Hebei, 065000, People’s Republic of China

    Lidong Wang

Authors
  1. Lidong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lidong Wang.

Additional information

L. Wang’s research was supported by NSFC Grant 10771051.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, L. On the Existence of Resolvable (K 3 + e)-Group Divisible Designs. Graphs and Combinatorics 26, 879–889 (2010). https://doi.org/10.1007/s00373-010-0954-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-010-0954-5

Keywords

Search

Navigation