A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Construction of balanced doubles schedules
1980
Journal of combinatorial theory. Series A
A recursive construction for v-player balanced doubles schedules based on resolvable B[4, 1; v] designs is presented. The schedules are resolvable when v E 4 (mod 12). Combined with special constructions for v = 54 and 55 and previously known constructions, this gives schedules for all v.
doi:10.1016/0097-3165(80)90022-9
fatcat:5u73cwpcofeyjdqbkj2twassda