Dehon, M., An existence theorem for some simple t-designs, Discrete Mathematics 90 (1991) 137-142. ## Let S' be a simple S;(t, k, [) containing b' blocks and let S be a, not necessarily simple, $(t, 1. u); we prove that if b"(A -1) < (:), then there exists a simple &,(t, k, v). We apply this resu
Some existence theorems for t-designs
β Scribed by Tran van Trung
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 640 KB
- Volume
- 128
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
We generalize some existence theorems for t- (u,k,l) designs. In fact, we prove that if certain inequality holds involving parameters of some simple r-designs, then new simple t-designs can be constructed.
Using these results we discover first examples of infinite families of 5-designs in which blocks always intersect in less than (k -1) points.
π SIMILAR VOLUMES
## Abstract A set of trivial necessary conditions for the existence of a large set of __t__βdesigns, __LS__[N](__t,k,__Ξ½), is $N\big | {{\nu \hskip -3.1 \nu}-i \choose k-i}$ for __i__β=β0,β¦,__t__. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary condi