Some balanced complete block designs
Article
Received:
- 43 Downloads
- 6 Citations
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.
Keywords
Abelian Group Complete Graph Hamiltonian Cycle Steiner Triple System Unordered Pair
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.
Preview
Unable to display preview. Download preview PDF.
References
- 1.C. Berge,Théorie des graphes et ses applications, Dunod, Paris, 1958.Google Scholar
- 2.M. Hall,Combinatorial Theory, Addison-Wesley, Reading, Mass., 1968.Google Scholar
- 3.S. Schreiber,Some mappings of periodic groups, Israel J. Math.17, (1974), 117–123.MATHMathSciNetCrossRefGoogle Scholar
- 4.S. Schreiber,Covering all triples on n marks by Steiner systems, J. Comb. Theory. (A)15, 347–380 (1973).MATHCrossRefMathSciNetGoogle Scholar
- 5.G. J. Simmons,An extremal problem in the uniform covering of finite sets, J. Comb. Theory,13 (1972), 183–197.MATHCrossRefMathSciNetGoogle Scholar
- 6.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.Google Scholar
Copyright information
© The Weizmann Science Press of Israel 1974