分块平衡竞赛图设计的存在性
The existence of partitioned balanced tournament designs
摘要:
E. R. Lamken在[5]中证明了存在边$n$的分块平衡竞赛设计PBTD($n$),其中$n$为正整数$n \ge 5$,但可能不包括$n \in \{9,11,15\}$ .本文证明了$n \in \{9,11,15\}$的PBTD($n$)的存在性.结果,完全确定了PBTD($n$)的存在。
英文摘要:
E. R. Lamken prove in [5] that there exists a partitioned balanced tournament design of side $n$, PBTD($n$), for $n$ a positive integer, $n \ge 5$, except possibly for $n \in \{9,11,15\}$. In this article, we show the existence of PBTD($n$) for $n \in \{9,11,15\}$. As a consequence, the existence of PBTD($n$) has been completely determined.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。