Skip to main content
SpringerLink
Log in

Double resolvability of some complete 3-designs

  • Published:
manuscripta mathematica Aims and scope Submit manuscript

Abstract

The set of all combinations, of 3n things taken three at a time, can be partitioned into resolvable Steiner triple systems.

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. DENNISTON, R.H.F.: Sylvester's problem of the 15 schoolgirls. Discrete Math. (to appear).

  2. DOYEN, J.: Constructions of disjoint Steiner triple systems. Proc. Amer. math. Soc.32, 409–416 (1972).

    Google Scholar 

  3. KIRKMAN, T.P.: Note on an unanswered prize question. Cambridge & Dublin math. J.5, 255–262 (1850).

    Google Scholar 

  4. SCHREIBER, S.: Some balanced complete block designs. Israel J. Math. (to appear).

  5. SYLVESTER, J.J.: Note on a nine schoolgirls problem. Messenger of Math., II Ser.22, 159–160 (1893).

    Google Scholar 

  6. TEIRLINCK, L.: On the maximum number of disjoint Steiner triple systems (to appear).

Download references

Author information

Authors and Affiliations

  1. University of Leicester, LE1 7RH, England

    Ralph Hugh Francis Denniston

Authors
  1. Ralph Hugh Francis Denniston
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Denniston, R.H.F. Double resolvability of some complete 3-designs. Manuscripta Math 12, 105–112 (1974). https://doi.org/10.1007/BF01168645

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01168645

Keywords

Search

Navigation