AbstractA mandatory representation design MR(K; v) is a pairwise balanced design on v points with block sizes from K in which for each k ∈ K there is a block in the design of size k. The study of these designs is naturally associated with the study of pairwise balanced design having pre-specified subdesigns. We investigate the existence of MR(K; v)'s, where 3 ∈ K
AbstractAn expression involving a “remainder term” is given for the number of blocks in a minimal pa...
AbstractA block B denotes a set of k = k1 + k2 elements which are divided into two subsets, B1 and B...
AbstractA uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks c...
AbstractA mandatory representation design MR(K; v) is a pairwise balanced design on v points with bl...
A mandatory representation design MRD(K; v) is a pairwise balanced design on v points with block siz...
AbstractA mandatory representation design MRD(K;v) is a pairwise balanced design on v points with bl...
AbstractA mandatory representation design MRD(K;v) is a pairwise balanced design on v points with bl...
AbstractA uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks c...
AbstractThis paper deals with existence results for pairwise balanced designs with block sizes 8, 9,...
AbstractA class-uniformly resolvable pairwise balanced design CURD(K; p, r) is a pairwise balanced d...
AbstractIn this paper we obtain determinantal conditions necessary for the existence of (r,λ)-design...
AbstractIn this paper, we look at resolvable balanced incomplete block designs on v points having bl...
AbstractLet K = {k1,…,km} be a set of block sizes, and let {p1,…,pm} be nonnegative numbers with σmi...
AbstractA balanced incomplete block design (BIBD) B[k, λ;v] is an arrangement of v elements in block...
AbstractGiven positive integers k and λ, balanced incomplete block designs on v points with block si...
AbstractAn expression involving a “remainder term” is given for the number of blocks in a minimal pa...
AbstractA block B denotes a set of k = k1 + k2 elements which are divided into two subsets, B1 and B...
AbstractA uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks c...
AbstractA mandatory representation design MR(K; v) is a pairwise balanced design on v points with bl...
A mandatory representation design MRD(K; v) is a pairwise balanced design on v points with block siz...
AbstractA mandatory representation design MRD(K;v) is a pairwise balanced design on v points with bl...
AbstractA mandatory representation design MRD(K;v) is a pairwise balanced design on v points with bl...
AbstractA uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks c...
AbstractThis paper deals with existence results for pairwise balanced designs with block sizes 8, 9,...
AbstractA class-uniformly resolvable pairwise balanced design CURD(K; p, r) is a pairwise balanced d...
AbstractIn this paper we obtain determinantal conditions necessary for the existence of (r,λ)-design...
AbstractIn this paper, we look at resolvable balanced incomplete block designs on v points having bl...
AbstractLet K = {k1,…,km} be a set of block sizes, and let {p1,…,pm} be nonnegative numbers with σmi...
AbstractA balanced incomplete block design (BIBD) B[k, λ;v] is an arrangement of v elements in block...
AbstractGiven positive integers k and λ, balanced incomplete block designs on v points with block si...
AbstractAn expression involving a “remainder term” is given for the number of blocks in a minimal pa...
AbstractA block B denotes a set of k = k1 + k2 elements which are divided into two subsets, B1 and B...
AbstractA uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks c...
DOI
Add to ORKG