Construction of balanced doubles schedules

Paul Healey
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