×
Sharry, Martin J.; Street, Anne Penfold

Partitioning sets of quadruples into designs. III. (English) Zbl 0757.05021

Discrete Math. 92, No. 1-3, 341-359 (1991).
It is shown that the collection of all \({11\choose 4}\) quadruples chosen from a set of eleven points can be partitioned into eleven mutually disjoint 3-(10,4,1) designs in precisely 21 nonisomorphic ways. If the set of all the \({v\choose k}\) \(k\)-sets chosen from a set \(X\) can be partitioned into \(v\) mutually disjoint \(t-(v-1,\;k,\lambda)\) designs, each missing a different point of \(X\), these designs form a overlarge set. In this paper \(X=\{0,1,\dots,9,A\}\), and designs are labelled by their missing element.
Reviewer: M.Cheema (Tucson)

Cited in 2 Documents

MSC:

05B05 Combinatorial aspects of block designs
05A18 Partitions of sets

Keywords:

partitioning sets; quadruples; designs; partitions; blocks; overlarge set

Citations:

Zbl 0688.05003

Software:

nauty
Cite Review PDF
Full Text: DOI

References:

[1] Bays, S., Une question de Cayley relative au probleme des triades de Steiner, Enseign. Math., 19, 57-67 (1917) · JFM 46.0112.03
[2] Breach, D. R., The 2-(9, 4, 3) and 3-(10, 5, 3) designs, J. Combin. Theory Ser. A, 27, 50-63 (1979) · Zbl 0418.05013
[3] Breach, D. R.; Street, A. P., Partitioning sets of quadruples into designs II, J. Combin. Math. Combin. Comput., 3, 41-48 (1988) · Zbl 0714.05009
[4] Cannon, J., A language for group theory (1987), Department of Pure Mathematics, University of Sydney: Department of Pure Mathematics, University of Sydney Sydney, Australia
[5] Doyen, J.; Rosa, A., An updated bibliography and survey of Steiner systems, (Lindner, C. C.; Rosa, A., Topics on Steiner Systems. Topics on Steiner Systems, Ann. Discrete Math., 7 (1980), North-Holland: North-Holland Amsterdam), 317-349 · Zbl 0442.51006
[6] Kirkman, T. P., Note on an unaswered prize question, Cambridge and Dublin Math. J., 5, 255-262 (1850)
[7] Kramer, E. S.; Mesner, D. M., Intersections among Steiner systems, J. Combin. Theory Ser. A, 16, 273-285 (1974) · Zbl 0282.05011
[8] Kreher, D. L.; Radziszowski, S. P., The existence of simple 6-(14,7,4) designs, J. Combin. Theory Ser. A, 43, 237-243 (1986) · Zbl 0647.05013
[9] Mathon, R. A.; Phelps, K. T.; Rosa, A., Small Steiner triple systems and their properties, Ars Combin., 15, 3-110 (1983) · Zbl 0516.05010
[10] McKay, B. D., nauty User’s Guide (Version 1.2), Australian National University Computer Science Technical Report TR-CS-87-03 (1987)
[11] Rosa, A., A theorem on the maximum number of disjoint Steiner triple systems, J. Combin. Theory Ser. A, 18, 305-312 (1975) · Zbl 0306.05008
[12] Sharry, M. J.; Street, A. P., Partitioning sets of triples into designs II, J. Combin. Math. Combin. Comput., 4, 53-68 (1988) · Zbl 0676.05014
[13] Sharry, M. J., Partitioning sets of quintuples into designs, J. Combin. Math. Combin. Comput., 6, 67-103 (1989) · Zbl 0692.05010
[14] Sharry, M. J.; Street, A. P., Partitioning sets of blocks into designs, Australas. J. Combin., 3, 111-140 (1991) · Zbl 0763.05012
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.