Abstract Let X be a finite set of cardinality v. We denote the set of all k-subsets of X by In this paper we consider the problem of partitioning into two parts of equal size, each of which is the block set of a 2-(v k, λ) design. We determine necessary and sufficient conditions on v for the existence of such a partition when k=3 or 4. We also construct partitions for higher values of fc and infinitely many values of v. The case where k=3 has been solved for all values of v by Dehon [5]. The case where v=2k has been solved for all values of k by Alltop [1], The remaining results are new. The technique used is similar to that used by Denniston in his construction of a 4-(12,5,4) design without repeated blocks. We also prove an interesting corollary to Baranyai's theorem giving necessary and sufficient conditions for the existence of a partition of into 1- (v, k,λ) designs.
[1]
R. Denniston,et al.
A Small 4-Design
,
1983
.
[2]
Luc Teirlinck,et al.
On the maximum number of disjoint triple systems
,
1975
.
[3]
Lu Jia-xi,et al.
On Large Sets of Disjoint Steiner Triple Systems, IV
,
1983,
J. Comb. Theory, Ser. A.
[4]
William O. Alltop.
Extending t-Designs
,
1975,
J. Comb. Theory, Ser. A.
[5]
Donald L. Kreher,et al.
The existence of simple 6-(14, 7, 4) designs
,
1986,
J. Comb. Theory, Ser. A.
[6]
Leo G. Chouinard,et al.
Partitions of the 4-subsets of a 13-set into disjoint projective planes
,
1983,
Discret. Math..
[7]
Michel Dehon.
On the existence of 2-designs Slambda(2, 3, upsilon) without repeated blocks
,
1983,
Discret. Math..
[8]
Jean Van Buggenhaut,et al.
On the existence of 2-designs S2(2, 3, v) without repeated blocks
,
1974,
Discret. Math..