@article {
author = {Emami, Mojgan and Naserian, Ozra},
title = {On the number of mutually disjoint cyclic designs},
journal = {Transactions on Combinatorics},
volume = {3},
number = {1},
pages = {7-13},
year = {2014},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2014.3820},
abstract = {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 mutually disjoint cyclic $t$-$(v,k,\lambda)$designs. In this paper we give some new bounds for $N(2,29,4,3)$ and $N(2,31,4,2)$. Consequently we present new large sets $LS[9](2,4,29), LS[13](2,4,29)$ and $LS[7](2,4,31)$, where their existences were already known.},
keywords = {Large Set,$t$-Design,Kramer-Mesner Matrix},
url = {https://toc.ui.ac.ir/article_3820.html},
eprint = {https://toc.ui.ac.ir/article_3820_cf20d0b9a831a25a6c55e7bf6461ca78.pdf}
}