论文标题
在强大的比赛中，一系列循环的常见国王
Common kings of a chain of cycles in a strong tournament
论文作者
论文摘要
众所周知，每个强大的比赛都指挥任何长度的周期，从而实现任何规模的强大次要次数。在本说明中，我们证明他们也可以共享一个共同的顶点，这是所有人的国王。这个常见的顶点可以是整个比赛中的任何国王。此外，可以通过将一个额外的顶点插入一个有向边的边缘来递归构建中的汉密尔顿周期。
It is known that every strong tournament has directed cycles of any length, and thereby strong subtournaments of any size. In this note, we prove that they also can share a common vertex which is a king of all of them. This common vertex can be any king in the whole tournament. Further, the Hamiltonian cycles in them can be recursively constructed by inserting an additional vertex to one directed edge.
