A tournament graph over n players is weakly transitive at player p if it contains a Hamiltonian path \(\left( p_{1},p_{2}, \dots , p_{n}\right) \) with \( p_{1}=p\) such that for all odd integers \(i\le n-2\) there is an arc from \(p_{i}\) to \(p_{i+2}\). We show that weak transitivity at p suffices to make player p win any extended stepladder tournament of degree at most two.

中文翻译：

---

延缓梯子锦标赛的传递性和议程控制较弱

甲竞赛图上 Ñ玩家在玩家弱传递 p是否包含汉弥尔顿路径\（\左（P_ {1}，P_ {2}，\点，P_ {N} \右）\）与\（P_ { 1} = p \），这样对于所有奇数整数 \（i \ le n-2 \）都有一个从\（p_ {i} \）到 \（p_ {i + 2} \）的弧线 。我们证明了p的弱传递性 足以使玩家 p赢得最多两个度数的扩展梯级比赛。