在两个分区的循环赛中最大限度地使用公共装置
Maximising common fixtures in a round robin tournament with two divisions
摘要:
我们描述了一个循环赛的调度问题,在两个部门的比赛,由当地的体育组织带来的第二作者的调度问题的动机。第一级联赛有来自2n个俱乐部的球队,采用双循环赛,第二轮的抽签与第一轮相同。第二组有来自另外两个俱乐部的球队,在第一组的前2n+1轮中进行单循环赛。如果两个俱乐部在一级联赛和二级联赛中的球队安排在同一轮比赛中交手,我们将说这两个俱乐部有一个 ** 公共赛程 **,并证明当n>1时,公共赛程的最大可能数量是2n^2 - 3 n + 4。我们的建设提请实现这一最大值是基于双金字塔的一个因子分解的K_{2n},这代表了提请师一。此外,如果我们另外要求两个分区中的共同赛程的主客场状态相同,我们表明可以选择在所有三轮中保持平衡的平局。
英文摘要:
We describe a round robin scheduling problem for a competition played in two divisions, motivated by a scheduling problem brought to the second author by a local sports organisation. The first division has teams from 2n clubs, and is played in a double round robin in which the draw for the second round robin is identical to the first. The second division has teams from two additional clubs, and is played as a single round robin during the first 2n+1 rounds of the first division. We will say that two clubs have a **common fixture** if their teams in division one and two are scheduled to play each other in the same round, and show that for n>1 the maximum possible number of common fixtures is 2n^2 - 3n + 4. Our construction of draws achieving this maximum is based on a bipyramidal one-factorisation of K_{2n}, which represents the draw in division one. Moreover, if we additionally require the home and away status of common fixtures to be the same in both divisions, we show that the draw can be chosen to be balanced in all three round robins.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。