Question 5
Twenty players enter a chess tournament. Each plays each other player twice, once with White and once with Black. Player $X$ is “no weaker than” player $Y$ if $X$ has at least as many wins with White as $Y$, and at least as many wins with Black as $Y$. Must there be distinct players $A,B$ such that $A$ is no weaker than $B$? (5 points)

Neutral editorial illustration.

Neutral editorial illustration.