Abstract
Steiner’s “combinatorial problems” have so far been solved only fork=3 [5, 3] and fork=4 [1,2]. In this paper a complete solution of the problem is given for “closed” Steiner systems, i.e. systems havingn=2k−1−1 elements. Use is made of methods developed by Zaremba [7] for abelian groups.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
H. Hanani,On quadruple systems, Canad. J. Math.,12 (1960), 145–157.
H. Hanani,On some tactical configurations, Canad. J. Math.,15 (1963), 702–722.
E. H. Moore,Concerning triple systems, Math. Ann.,43 (1893), 271–285.
E. Netto,Lehrbuch der Combinatorik, zweite Auflage, Leipzig, 1927, pp. 202–204.
M. Reiss,Ueber eine Steinersche combinatorische Aufgabe, J. Reine Angew. Math.,56, (1859), 326–344.
J. Steiner,Combinatorische Aufgabe, J. Reine Angew. Math.,45 (1853), 181–182.
S. K. Zaremba,A covering theorem for abelian groups, J. London, Math. Soc.,26 (1950), 71–72.
Author information
Authors and Affiliations
Additional information
This research was supported by the United States Air Force under Grant No. AF-EOAR-6360 and monitored by the European Office of Aerospace Research.
An erratum to this article is available at http://dx.doi.org/10.1007/BF02937460.
Rights and permissions
About this article
Cite this article
Hanani, H., Schonheim, J. On steiner systems. Israel J. Math. 2, 139–142 (1964). https://doi.org/10.1007/BF02759954
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02759954