Title of article
ON THE NUMBER OF MUTUALLY DISJOINT CYCLIC DESIGNS
Author/Authors
امامي ، مژگان نويسنده Department of Mathematics, University of Zanjan, P.O.Box 45371-38791, Zanjan, Iran Emami, Mojgan , ناصريان، عذرا نويسنده Department of Mathematics, University of Zanjan, P. O. Box 45371-38791, Zanjan, Iran Naserian, Ozra
Issue Information
فصلنامه با شماره پیاپی 0 سال 2014
Pages
7
From page
7
To page
13
Abstract
We denote by LS[N](t; k; v) a large set of t-(v; k; ) designs of size N, which is a partition
of all k-subsets of a v-set into N disjoint t-(v; k; ) designs and N = ??v??t
k??t=. We use the notation
N(t; v; k; ) as the maximum possible number of mutually disjoint cyclic t-(v; k; )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.
Journal title
Transactions on Combinatorics
Serial Year
2014
Journal title
Transactions on Combinatorics
Record number
1116652
Link To Document