On the number of mutually disjoint cyclic designs
We denote by $LS[N](t,k,v)$ a large set of $t$-$(v,k,\lambda)$ designs of size $N$, which is a partition of all $k$-subsets of a $v$-set into $N$ disjoint $t$-$(v,k,\lambda)$ designs and $N={v-t \choose k-t}/\lambda$. We use the notation $N(t,v,k,\lambda)$ as the maximum possible number of mu...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2014-03-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/pdf_3820_cf20d0b9a831a25a6c55e7bf6461ca78.html |