AbstractA class-uniformly resolvable pairwise balanced design CURD(K; p, r) is a pairwise balanced design (of index 1) on p points, with block sizes from the set K, whose block set can be resolved into r parallel classes, each parallel class containing a fixed number ak of blocks of size k ϵ K. We indicate why such design arise and give some examples for K = {2, 3}
AbstractIn this paper, we look at resolvable balanced incomplete block designs on v points having bl...
AbstractThis paper deals with existence results for pairwise balanced designs with block sizes 8, 9,...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...
AbstractA class-uniformly resolvable pairwise balanced design CURD(K; p, r) is a pairwise balanced d...
AbstractA uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks c...
AbstractA uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks c...
A central question in design theory dating from Kirkman in 1850 has been the existence of resolvable...
AbstractThe aim of this paper is to show the following Theorem: If D is an (r, λ)-design (regular pa...
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...
AbstractA mandatory representation design MR(K; v) is a pairwise balanced design on v points with bl...
AbstractA balanced incomplete block design (BIBD) B[k, λ;v] is an arrangement of v elements in block...
AbstractA t-wise balanced design is said to be resolvable if its block set can be partitioned into p...
AbstractEach parallel class of a uniformly resolvable design (URD) contains blocks of only one block...
AbstractLet k, λ, and υ be positive integers. A perfect cyclic design in the class PD(υ, k, λ) consi...
AbstractIn this paper, we look at resolvable balanced incomplete block designs on v points having bl...
AbstractThis paper deals with existence results for pairwise balanced designs with block sizes 8, 9,...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...
AbstractA class-uniformly resolvable pairwise balanced design CURD(K; p, r) is a pairwise balanced d...
AbstractA uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks c...
AbstractA uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks c...
A central question in design theory dating from Kirkman in 1850 has been the existence of resolvable...
AbstractThe aim of this paper is to show the following Theorem: If D is an (r, λ)-design (regular pa...
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...
AbstractA mandatory representation design MR(K; v) is a pairwise balanced design on v points with bl...
AbstractA balanced incomplete block design (BIBD) B[k, λ;v] is an arrangement of v elements in block...
AbstractA t-wise balanced design is said to be resolvable if its block set can be partitioned into p...
AbstractEach parallel class of a uniformly resolvable design (URD) contains blocks of only one block...
AbstractLet k, λ, and υ be positive integers. A perfect cyclic design in the class PD(υ, k, λ) consi...
AbstractIn this paper, we look at resolvable balanced incomplete block designs on v points having bl...
AbstractThis paper deals with existence results for pairwise balanced designs with block sizes 8, 9,...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...