Design theory
The existence of Skew Howell designs of side 2n and order 2n+2
Journal of Combinatorial Theory Series A
On combinatorial designs with subdesigns
Discrete Mathematics - Combinatorial designs: a tribute to Haim Hanani
The existence of 3 orthogonal partitioned incomplete Latin squares of type tn
Discrete Mathematics
Howell designs with sub-designs
Journal of Combinatorial Theory Series A
The spectrum of HSOLSSOM(hn) where h is even
Discrete Mathematics
Resolvable group divisible designs with block size four
Discrete Mathematics
On Group-Divisible Designs with Block Size Four and Group-Type gum1
Designs, Codes and Cryptography
The existence of three idempotent IMOLS
Discrete Mathematics
A note on {4}-GDDs of type 210
Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
Resolvable group divisible designs with block size four and group size six
Discrete Mathematics
Resolvable maximum packings with quadruples
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In this paper, we construct CCRRS, complete coupling round robin schedules, for n teams each consisting of two pairs. The motivation for these schedules is a problem in scheduling bridge tournaments. We construct CCRRS(n) for n a positive integer, n ≥ 3, with the possible exceptions of n ∈ {54, 62}. For n odd, we show that a CCRRS(n) can be constructed using a house with a special property. For n even, a CCRRS(n) can be constructed from a Howell design, H(2n - 2, 2n), with a special property called Property P. We use a combination of direct and recursive constructions to construct H(2n - 2, 2n) with Property P. In order to apply our main recursive construction, we need group divisible designs with odd group sizes and odd block sizes. One of our main results is the existence of these group divisible designs.