Journal of Geometry

, Volume 19, Issue 1, pp 115–129 | Cite as

On the parameters of strongly resolvable designs

  • Albrecht Beutelspacher
  • Ursula Porta


We prove a series of inequalities among the parameters of a strongly resolvable design. By means of examples it is shown that these inequalities are best possible.


Resolvable Design 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Beker, H.: On Strong Tactical Decompositions. J. London Math. Soc.16 (1977), 191–196.Google Scholar
  2. 2.
    Beker, H.: Constructions and Decompositions of Designs. Ph.D. Thesis, University of London, 1976.Google Scholar
  3. 3.
    Beker, H. and Haemers, W.: 2-Designs Having an Intersection Number k-n. J. Combinatorial Theory (A)28 (1980), 64–81.CrossRefGoogle Scholar
  4. 4.
    Dembowski, P.: Finite Geometries. Berlin-Heidelberg-New York, Springer 1968.Google Scholar
  5. 5.
    Harris, R.G.R.: On Automorphisms and Resolutions of Designs. Ph.D. Thesis, University of London, 1975.Google Scholar
  6. 6.
    Hughes, D.R. and Piper, F.C.: On Resolutions and Bose's Theorem. Geom. Dedicata5 (1976), 129–133.CrossRefGoogle Scholar
  7. 7.
    Majumdar, K.N.: On Some Theorems in Combinatorics Relating to Incomplete Block Designs. Ann. Math. Statist.24 (1953), 377–389.Google Scholar
  8. 8.
    Shrikhande, S.S. and Raghavarao, D.: A Method of Construction of Incomplete Block Designs. Sankhyā A25 (1963), 399–402.Google Scholar

Copyright information

© Birkhäuser Verlag 1982

Authors and Affiliations

  • Albrecht Beutelspacher
    • 1
  • Ursula Porta
    • 1
  1. 1.Fachbereich Mathematik der UniversitätMainzWest Germany

Personalised recommendations