AbstractEach parallel class of a uniformly resolvable design (URD) contains blocks of only one block size k (denoted k-pc). The number of k-pcs is denoted rk. The necessary conditions for URDs with v points, index one, blocks of size 3 and 5, and r3,r5>0, are v≡15(mod30). If rk>1, then v≥k2, and r3=(v−1−4⋅r5)/2. For r5=1 these URDs are known as group divisible designs. We prove that these necessary conditions are sufficient for r5=3 except possibly v=105, and for r5=2,4,5 with possible exceptions (v=105,165,285,345) New labeled frames and labeled URDs, which give new URDs as ingredient designs for recursive constructions, are the key in the proofs
AbstractA balanced incomplete block design D(v, k, λ) is α-resolvable if its blocks can be partition...
AbstractLet k, λ, and υ be positive integers. A perfect cyclic design in the class PD(υ, k, λ) consi...
AbstractLet n≡k-1,0 or 1(modk). An R˜MP(k,λ;n,m) (resp. R˜MC(k,λ;n,m)) is a resolvable packing (resp...
AbstractEach parallel class of a uniformly resolvable design (URD) contains blocks of only one block...
AbstractEach parallel class of a uniformly resolvable design (URD) contains blocks of only one block...
A central question in design theory dating from Kirkman in 1850 has been the existence of resolvable...
AbstractA class-uniformly resolvable pairwise balanced design CURD(K; p, r) is a pairwise balanced d...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...
The spectrum of orthogonal group divisible designs with block size three, and u groups each of size ...
AbstractIt is proved in this paper that for m≢0,2,6,10(mod12) there exists a resolvable group divisi...
Group divisible designs (GDDs) play a crucial role in the development of combinatorial design theory...
AbstractIn this paper, we shall investigate the existence of resolvable group divisible designs (RGD...
AbstractLet v be a non negative integer, let λ be a positive integer, and let K and M be sets of pos...
AbstractA class-uniformly resolvable pairwise balanced design CURD(K; p, r) is a pairwise balanced d...
AbstractIn this paper, we investigate the existence of resolvable group divisible designs (RGDDs) wi...
AbstractA balanced incomplete block design D(v, k, λ) is α-resolvable if its blocks can be partition...
AbstractLet k, λ, and υ be positive integers. A perfect cyclic design in the class PD(υ, k, λ) consi...
AbstractLet n≡k-1,0 or 1(modk). An R˜MP(k,λ;n,m) (resp. R˜MC(k,λ;n,m)) is a resolvable packing (resp...
AbstractEach parallel class of a uniformly resolvable design (URD) contains blocks of only one block...
AbstractEach parallel class of a uniformly resolvable design (URD) contains blocks of only one block...
A central question in design theory dating from Kirkman in 1850 has been the existence of resolvable...
AbstractA class-uniformly resolvable pairwise balanced design CURD(K; p, r) is a pairwise balanced d...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...
The spectrum of orthogonal group divisible designs with block size three, and u groups each of size ...
AbstractIt is proved in this paper that for m≢0,2,6,10(mod12) there exists a resolvable group divisi...
Group divisible designs (GDDs) play a crucial role in the development of combinatorial design theory...
AbstractIn this paper, we shall investigate the existence of resolvable group divisible designs (RGD...
AbstractLet v be a non negative integer, let λ be a positive integer, and let K and M be sets of pos...
AbstractA class-uniformly resolvable pairwise balanced design CURD(K; p, r) is a pairwise balanced d...
AbstractIn this paper, we investigate the existence of resolvable group divisible designs (RGDDs) wi...
AbstractA balanced incomplete block design D(v, k, λ) is α-resolvable if its blocks can be partition...
AbstractLet k, λ, and υ be positive integers. A perfect cyclic design in the class PD(υ, k, λ) consi...
AbstractLet n≡k-1,0 or 1(modk). An R˜MP(k,λ;n,m) (resp. R˜MC(k,λ;n,m)) is a resolvable packing (resp...