Skip to main content
Log in

Another construction for large sets of Kirkman triple systems

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

Abstract

A large set of Kirkman triple systems of order v, denoted by LKTS(v), is a collection \(\{(X, \mathcal {B}_i) : 1 \leq i \leq v - 2\}\), where every \((X, \mathcal {B}_i)\) is a KTS(v) and all \(\mathcal {B}_i\) form a partition of all triples on X. In this article, we give a new construction for LKTS(6v + 3) via OLKTS(2v + 1) with a special property and obtain new results for LKTS, that is there exists an LKTS(3v) for \(v = \prod_{i=1}^{p}(2q_i^{r_i}+1)\prod_{j=1}^{q}(4^{s_j}-1)\), where p, q ≥ 0, r i , s j ≥ 1, q i is a prime power and \(q_i \equiv 7\) mod 12.

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. Chang Y., Ge G. (1999) Some new large sets of KTS(v). Ars Combin. 51:306–312

    MATH  MathSciNet  Google Scholar 

  2. Denniston R.H.F. (1974) Sylvester’s problem of the 15 schoolgirls. Discrete Math. 9:229–238

    Article  MATH  MathSciNet  Google Scholar 

  3. Denniston R.H.F. (1974) Double resolvability of some complete 3-designs. Manuscripta Math. 12:105–112

    Article  MATH  MathSciNet  Google Scholar 

  4. Denniston R.H.F. (1979) Four double resolvable complete three-designs. Ars Combin. 7:265–272

    MATH  MathSciNet  Google Scholar 

  5. Denniston R.H.F. (1979) Further cases of double resolvability. J. Combin. Theory Ser. A 26:298–303

    Article  MATH  MathSciNet  Google Scholar 

  6. Ge G. (2004) More large sets of KTS(v). J. Combin. Math. Combin. Comput 49:211–214

    MATH  MathSciNet  Google Scholar 

  7. Hartman A. (1994) The fundamental construction for 3-designs. Discrete Math 124:107–132

    Article  MATH  MathSciNet  Google Scholar 

  8. Ji L., Lei J.: Further results on large sets of Kirkman triple systems, preprint.

  9. Ji L. (2007) A construction for large sets of disjoint Kirkman triple systems. Des. Codes Cryptogr 43:115–122

    Article  MATH  MathSciNet  Google Scholar 

  10. Lei J. (2002) On large sets of Kirkman triple systems with holes. Discrete Math 254:259–274

    Article  MATH  MathSciNet  Google Scholar 

  11. Lei J. (2002) On large sets of disjoint Kirkman triple systems. Discrete Math. 257:63–81

    Article  MATH  MathSciNet  Google Scholar 

  12. Ray-Chaudhuri D.K., Wilson R.M. (1971) Solution of Kirkman’s school-girl problem. Proc. Symp. Pure Math. 19:187–203

    MathSciNet  Google Scholar 

  13. Stinson D.R. (1987) Frames for Kirkman triple systems and related designs. Discrete Math. 65:289–300

    Article  MATH  MathSciNet  Google Scholar 

  14. Wu L. (1990) On large sets of KTS(v). In: Wallis W.D. et al. (ed). Combinatorial Designs and Applications. Marcel Dekker, New York, pp. 175–178

    Google Scholar 

  15. Yuan L., Kang Q.: Some infinite families of large sets of Kirkman triple systems S. J. Comb. Des. published online: 18 June (2007).

  16. Yuan L., Kang Q.: On overlarge sets of Kirkman triple systems. Manuscript.

  17. Yuan L.: Large sets and overlarge sets of triple systems with resolvability. Dissertation for Doctor Degrees, Hebei Normal University (2007).

  18. Zhang., Zhu L. (2003) An improved product construction for large sets of Kirkman triple system. Discrete Math. 260:307–313

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Landang Yuan.

Additional information

Communicated by J. D. Key.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yuan, L., Kang, Q. Another construction for large sets of Kirkman triple systems. Des. Codes Cryptogr. 48, 35–42 (2008). https://doi.org/10.1007/s10623-008-9168-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-008-9168-8

Keywords

AMS Classification

Navigation