Abstract
Letq=6t±1, ν=2q+2. The (ν/3) tri ples on ν marks may be partitioned intoq sets, each forming a BIBD of parameters (ν,3,2). Related results, some of them known, are also discussed briefly.
Similar content being viewed by others
References
C. Berge,Théorie des graphes et ses applications, Dunod, Paris, 1958.
M. Hall,Combinatorial Theory, Addison-Wesley, Reading, Mass., 1968.
S. Schreiber,Some mappings of periodic groups, Israel J. Math.17, (1974), 117–123.
S. Schreiber,Covering all triples on n marks by Steiner systems, J. Comb. Theory. (A)15, 347–380 (1973).
G. J. Simmons,An extremal problem in the uniform covering of finite sets, J. Comb. Theory,13 (1972), 183–197.
G. V. Zaitsev, V. A. Zinovjev and N. V. Semalzov,Interrelation of Preparata and Hamming codes etc., 2nd International Symposium on Information Theory, Tsahlzadsor, Armenia, USSR, 1971, Akedemiai Kiado, Budapest, 1973.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schreiber, S. Some balanced complete block designs. Israel J. Math. 18, 31–37 (1974). https://doi.org/10.1007/BF02758127
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02758127