Complete mixed doubles round robin tournaments

zbMATH Open1337.05013arXiv1310.5240MaRDI QIDQ2809936FDOQ2809936

Authors: David R. Berman, Ian N. Wakeling 

Publication date: 30 May 2016

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Abstract: We present a new type of tournament design that we call a complete mixed doubles round robin tournament, CMDRR(n,k), that generalizes spouse-avoiding mixed doubles round robin tournaments and strict Mitchell mixed doubles round robin tournaments. We show that CMDRR(n,k) exist for all allowed values of n and k apart from 4 exceptions and 31 possible exceptions. We show that a fully resolvable CMDRR(2n,0) exists for all n $ge$ 5 and a fully resolvable CMDRR(3n,n) exists for all n $ge$ 5 and n odd. We prove a product theorem for constructing CMDRR(n,k).

Full work available at URL: https://arxiv.org/abs/1310.5240

Recommendations

• scientific article; zbMATH DE number 554187
• Mitchell tournaments
• scientific article; zbMATH DE number 5914930
• scientific article; zbMATH DE number 6269066
• scientific article; zbMATH DE number 1161298

zbMATH Keywords

complete mixed doubles round robin tournamentfully resolvableholey self-orthogonal Latin squarespouse-avoiding mixed doubles round robin tournamentstrict Mitchell mixed doubles round robin tournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Mitchell tournaments
• A Mixed Doubles Tournament Problem
• Scheduling CCRR tournaments

This page was built for publication: Complete mixed doubles round robin tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809936)