Abstract
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 ≡ 4 (mod 12). Combined with special constructions for v = 54 and 55 and previously known constructions, this gives schedules for all v.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
