Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Esther R. Lamken"'
Autor:
Peter J. Dukes, Esther R. Lamken
Publikováno v:
Journal of Combinatorial Designs. 30:581-608
Autor:
Esther R. Lamken, Peter J. Dukes
Publikováno v:
Designs, Codes and Cryptography. 87:2729-2751
We give explicit constructions for incomplete pairwise balanced designs IPBD((v; w), K), or, equivalently, edge-decompositions of a difference of two cliques $$K_v \setminus K_w$$ into cliques whose sizes belong to the set K. Our constructions produc
Publikováno v:
Canadian Mathematical Bulletin. 59:287-302
An incomplete pairwise balanced design is equivalent to a pairwise balanced design with a distinguished block, viewed as a ‘hole’. If there are v points, a hole of size w, and all (other) block sizes equal k, this is denoted IPBD((v;w), k). In ad
Publikováno v:
The Electronic Journal of Combinatorics. 23
We prove that the necessary divisibility conditions are sufficient for the existence of resolvable group divisible designs with a fixed number of sufficiently large groups. Our method combines an application of the Rees product construction with a st
Publikováno v:
Discrete Mathematics. 313:1368-1384
A Howell design of side s and order 2 n + 2 , or more briefly an H ( s , 2 n + 2 ) , is an s × s array in which each cell is either empty or contains an unordered pair of elements from some 2 n + 2 set V such that (1) every element of V occurs in pr
Autor:
R. Julian R. Abel, Esther R. Lamken, Charles J. Colbourn, Jinhua Wang, Nigel Chan, Chengmin Wang
Publikováno v:
Journal of Combinatorial Designs. 21:342-358
Necessary conditions for existence of a resolvable group divisible design (GDD) with block size 3 and type (a nearly Kirkman triple system, NKTS(v)), are and (mod 6). In this paper, we look at doubly resolvable NKTS(v)s; here we find that these neces
Publikováno v:
Mathematics and Sports. :203-216
At any stage, let G be the underlying graph of the union of the rounds already held. In order for the tournament to continue, the complement of G must contain a 1-factor; in other words, the set of factors chosen so far must not be premature (see [18
Publikováno v:
Discrete Mathematics. (1-3):197-209
A 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