PUMaC 2011 · 个人决赛（B 组） · 第 3 题

PUMaC 2011 — Individual Finals (Division B) — Problem 3

In a k -player tournament for k > 1, every player plays every other player exactly once. Find with proof the smallest value of k such that it is possible that for any two players, there was a third player who beat both of them. Please write complete, concise and clear proofs. Have fun! – PUMaC Problem Writers 1

解析

暂无解答链接。

No solutions link available.