混合双打循环赛
Complete Mixed Doubles Round Robin Tournaments
摘要:
我们提出了一种新类型的比赛设计,我们称之为一个完整的混合双打循环赛,CMDRR(n,k),概括配偶避免混合双打循环赛和严格的米切尔混合双打循环赛。我们发现,CMDRR(n,k)存在的所有允许的值的n和k除了4个例外和31个可能的例外。我们证明了对于所有n个$\ge$ 5都存在完全可分辨的CMDRR(2n,0),对于所有n个$\ge$ 5和n个奇数都存在完全可分辨的CMDRR(3n,n).我们证明了一个构造CMDRR(n,k)的乘积定理。
英文摘要:
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).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。