Skip to main content
Log in

Resolvable Maximum Packings with Quadruples

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Let V be a finite set of v elements. A packing of the pairs of V by k-subsets is a family F of k-subsets of V, called blocks, such that each pair in V occurs in at most one member of F. For fixed v and k, the packing problem is to determine the number of blocks in any maximum packing. A maximum packing is resolvable if we can partition the blocks into classes (called parallel classes) such that every element is contained in precisely one block of each class. A resolvable maximum packing of the pairs of V by k-subsets is denoted by RP(v,k). It is well known that an RP(v,4) is equivalent to a resolvable group divisible design (RGDD) with block 4 and group size h, where h=1,2 or 3. The existence of 4-RGDDs with group-type h n for h=1 or 3 has been solved except for (h,n)=(3,4) (for which no such design exists) and possibly for (h,n)∈{(3,88),(3,124)}. In this paper, we first complete the case for h=3 by direct constructions. Then, we start the investigation for the existence of 4-RGDDs of type 2n. We shall show that the necessary conditions for the existence of a 4-RGDD of type 2n, namely, n ≥ 4 and n ≡ 4 (mod 6) are also sufficient with 2 definite exceptions (n=4,10) and 18 possible exceptions with n=346 being the largest. As a consequence, we have proved that there exists an RP(v,4) for v≡ 0 (mod 4) with 3 exceptions (v=8,12 or 20) and 18 possible exceptions.

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.

Institutional subscriptions

Similar content being viewed by others

References

  • A. M. Assaf A. Hartman (1989) ArticleTitleResolvable group divisible designs with block size 3 Discrete Math. 77 5–20 Occurrence Handle0714.05007 Occurrence Handle1022446

    MATH  MathSciNet  Google Scholar 

  • T Beth D Jungnickel H Lenz (1985) Design Theory Bibliographisches Institut Zurich Occurrence Handle0569.05002

    MATH  Google Scholar 

  • C. J. Colbourn and J. H. Dinitz, CRC Handbook of Combinatorial Designs, CRC Press Inc., Boca Raton (1996). (New results are reported at http://www.emba.uvm.edu/~dinitz/newresults.html).

  • C. J. Colbourn D. R. Stinson L. Zhu (1997) ArticleTitleMore frames with block size four J. Combin. Math. Combin. Comput. 23 3–20 Occurrence Handle0879.05016 Occurrence Handle1432743

    MATH  MathSciNet  Google Scholar 

  • S. C. Furino S. Kageyama A. C. H. Ling Y. Miao J. X. Yin (2002) ArticleTitleFrames with block size four and index three J. Stat. Plann. Infer. 106 117–124 Occurrence Handle1014.05010 Occurrence Handle1927705

    MATH  MathSciNet  Google Scholar 

  • SC Furino Y Miao JX Yin (1996) Frames and Resolvable Designs: Uses, Constructions and Existence CRC Press Boca Raton FL Occurrence Handle0855.62061

    MATH  Google Scholar 

  • G. Ge (2001) ArticleTitleUniform frames with block size four and index one or three J. Combin. Designs 9 28–39 Occurrence Handle0971.05018

    MATH  Google Scholar 

  • G. Ge (2002) ArticleTitleResolvable group divisible designs with block size four Discrete Math. 243 109–119 Occurrence Handle1001.05018 Occurrence Handle1874729

    MATH  MathSciNet  Google Scholar 

  • G. Ge C. W. H. Lam A. C. H. Ling (2004) ArticleTitleSome new uniform frames with block size four and index one or three J. Combin. Designs 12 112–122 Occurrence Handle1033.05010 Occurrence Handle2036649

    MATH  MathSciNet  Google Scholar 

  • G. Ge C. W. H. Lam (2003) ArticleTitleResolvable group divisible designs with block size four and group size six Discrete Math. 268 139–151 Occurrence Handle1018.05010 Occurrence Handle1983274

    MATH  MathSciNet  Google Scholar 

  • H. Hanani D. K. Ray-Chauduri R. M. Wilson (1972) ArticleTitleOn resolvable designs Discrete Math. 3 343–357 Occurrence Handle0263.05016 Occurrence Handle309752

    MATH  MathSciNet  Google Scholar 

  • D. L. Kreher A. C. H. Ling R. S. Rees C. W. H. Lam (2003) ArticleTitleA note on {4}-GDDs of type 210 Discrete Math. 261 373–376 Occurrence Handle1008.05014 Occurrence Handle1961758

    MATH  MathSciNet  Google Scholar 

  • ER Lamken WH Mills RS Rees (1998) ArticleTitleResolvable minimum coverings with quadruples J. Combin. Designs 6 431–450 Occurrence Handle0910.05019 Occurrence Handle1648321

    MATH  MathSciNet  Google Scholar 

  • R. S. Rees (1993) ArticleTitleTwo new direct product type constructions for resolvable group divisible designs J. Combin. Designs 1 15–20 Occurrence Handle0817.05008 Occurrence Handle1303521

    MATH  MathSciNet  Google Scholar 

  • R. S. Rees (2000) ArticleTitleGroup divisible designs with block size k having k+1 groups for k= 4 and 5 J. Combin. Designs 8 363–386 Occurrence Handle0957.05014 Occurrence Handle1775789

    MATH  MathSciNet  Google Scholar 

  • R. S. Rees D. R. Stinson (1987) ArticleTitleOn resolvable group-divisible designs with block size 3 Ars Combin. 23 107–120 Occurrence Handle0621.05004 Occurrence Handle886946

    MATH  MathSciNet  Google Scholar 

  • R. S. Rees D. R. Stinson (1992) ArticleTitleFrames with block size four Canad. J. Math. 44 1030–1049 Occurrence Handle0769.05020 Occurrence Handle1186479

    MATH  MathSciNet  Google Scholar 

  • H. Shen (1987) ArticleTitleResolvable group divisible designs with block size 4 J. Combin. Math. Combin. Comput. 1 125–130 Occurrence Handle0649.05013 Occurrence Handle888836

    MATH  MathSciNet  Google Scholar 

  • H. Shen (1992) ArticleTitleOn the existence of nearly Kirkman systems Ann. Discrete Math. 52 511–518 Occurrence Handle10.1016/S0167-5060(08)70934-8

    Article  Google Scholar 

  • H. Shen (1996) ArticleTitleExistence of resolvable group divisible designs with block size four and group size two or three J. Shanghai Jiaotong Univ. (Engl. Ed.) 1 68–70 Occurrence Handle1454271

    MathSciNet  Google Scholar 

  • H. Shen J. Shen (2002) ArticleTitleExistence of resolvable group divisible designs with block size four I Discrete Math. 254 513–525 Occurrence Handle0995.05014 Occurrence Handle1910128

    MATH  MathSciNet  Google Scholar 

  • DR Stinson (1996) Packings CJ Colbourn JH Dinitz (Eds) CRC Handbook of Combinatorial Designs CRC Press Boca Raton FL

    Google Scholar 

  • R. M. Wilson (1974) ArticleTitleConstructions and uses of pairwise balanced designs Math. Centre Tracts 55 18–41

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gennian GE.

Additional information

Gennian Ge Researcher supported in part by YNSFC Grant 10001026

C.W.H. Lam Researcher supported by the National Science and Research Council of Canada

Alan C.H. Ling Researcher supported by an ARO grant 19-01-1-0406 and a DOE grant

Researcher supported by NSFC Grant 19831050

Rights and permissions

Reprints and permissions

About this article

Cite this article

GE, G., LAM, C.W.H., Ling, A.C.H. et al. Resolvable Maximum Packings with Quadruples. Des Codes Crypt 35, 287–302 (2005). https://doi.org/10.1007/s10623-003-6739-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-003-6739-6

Keywords

Navigation