AbstractA t-design λ; t-d-n is a system of subsets of size d (called blocks) from an n-set S, such that each t-subset from S is contained in precisely λ blocks. A Steiner system S(l, m, n) is a t-design with parameters 1; l-m-n. Two Steiner systems (or t-designs) are disjoint if they share no blocks. A search has been conducted which resulted in discovering 9 mutually disjoint S(5, 8, 24)'s, 24 mutually disjoint S(4, 7, 23)'s, 60 mutually disjoint S(3, 6, 22)'s, and 197 mutually disjoint S(2, 5, 21)'s. Taking unions of several mutually disjoint Steiner systems will then produce t-designs (with varying λ's) on 21, 22, 23, and 24 points
Let N(t; v; k; ) be the maximum possible number of mutually disjoint cyclic t- (v; k; ) designs. In...
AbstractA t-design or generalized Steiner systemS(λ; t, k, υ) is a pair (X, B) with a υ-set X of poi...
A Steiner system S(2, 4, v) is a v-element set V together with a collection B of 4-subsets of V cal...
AbstractA Steiner system S(l, m, n) is a system of subsets of size m (called blocks) from an n-set S...
AbstractKramer and Magliveras constructed simple 5-(24,8,λ) designs for λ⩽9. Betten et al. construct...
AbstractWe considert-designs withλ=1 (generalized Steiner systems) for which the block size is not n...
AbstractGiven a Steiner system S(2, k–1; v) with v ⩾ vo(k), there is a 3-design Sλ(3, k; v + 1) such...
AbstractWe give a construction of a 2-(mn2+1,mn,(n+1)(mn−1)) design starting from a Steiner system S...
AbstractThere exist 13 mutually disjoint resolutions of the Steiner system S(5, 8, 24). There also e...
AbstractIf a Steiner system S(4,5,17) exists, it would contain derived S(3,4,16) designs. By relying...
AbstractIt is well known that the extended binary Golay [24,12,8] code yields 5-designs. In particul...
AbstractIn a previous paper (J. Combin. Theory Ser. A 34 (1983), 156–182), to construct large sets o...
AbstractThree extension theorems for t-designs are proved; two for t even, and one for t odd. Anothe...
AbstractThere are exactly 16 non-isomorphic Steiner systems S(2, 4, 25) with nontrivial automorphism...
AbstractLet q be a prime power and a be a positive integer such that a⩾2. Assume that there is a Ste...
Let N(t; v; k; ) be the maximum possible number of mutually disjoint cyclic t- (v; k; ) designs. In...
AbstractA t-design or generalized Steiner systemS(λ; t, k, υ) is a pair (X, B) with a υ-set X of poi...
A Steiner system S(2, 4, v) is a v-element set V together with a collection B of 4-subsets of V cal...
AbstractA Steiner system S(l, m, n) is a system of subsets of size m (called blocks) from an n-set S...
AbstractKramer and Magliveras constructed simple 5-(24,8,λ) designs for λ⩽9. Betten et al. construct...
AbstractWe considert-designs withλ=1 (generalized Steiner systems) for which the block size is not n...
AbstractGiven a Steiner system S(2, k–1; v) with v ⩾ vo(k), there is a 3-design Sλ(3, k; v + 1) such...
AbstractWe give a construction of a 2-(mn2+1,mn,(n+1)(mn−1)) design starting from a Steiner system S...
AbstractThere exist 13 mutually disjoint resolutions of the Steiner system S(5, 8, 24). There also e...
AbstractIf a Steiner system S(4,5,17) exists, it would contain derived S(3,4,16) designs. By relying...
AbstractIt is well known that the extended binary Golay [24,12,8] code yields 5-designs. In particul...
AbstractIn a previous paper (J. Combin. Theory Ser. A 34 (1983), 156–182), to construct large sets o...
AbstractThree extension theorems for t-designs are proved; two for t even, and one for t odd. Anothe...
AbstractThere are exactly 16 non-isomorphic Steiner systems S(2, 4, 25) with nontrivial automorphism...
AbstractLet q be a prime power and a be a positive integer such that a⩾2. Assume that there is a Ste...
Let N(t; v; k; ) be the maximum possible number of mutually disjoint cyclic t- (v; k; ) designs. In...
AbstractA t-design or generalized Steiner systemS(λ; t, k, υ) is a pair (X, B) with a υ-set X of poi...
A Steiner system S(2, 4, v) is a v-element set V together with a collection B of 4-subsets of V cal...