An extending theorem for s-resolvable t-designs is presented, which may be viewed as an extension of Qiu-rong Wu's result. The theorem yields recursive constructions for s-resolvable t-designs, and mutually disjoint t-designs. For example, it can be shown that if there exists a large set LS[29](4, 5, 33), then there exists a family of 3-resolvable 4-(5 + 29m, 6, 5/2m(1 + 29m)) designs for m = 1, with 5 resolution classes. Moreover, for any given integer h = 1, there exist (5 . 2(h)-5) mutually disjoint simple 3-(3+m(5 . 2(h)-3), 4, m) designs for all m = 1. In addition, we give a brief account of t-designs derived from the result of Wu.
展开▼
