MathDB

At a turnament between

n

persons, everyone playes exactly one time against everyone else, and at one game there is everytime a winner and a looser. Prove that one can arrange the participants in a chain

P_1 \to P_2 \to ... \to P_n

such that the

i

-th person has won against the

(i+1)

-th person.

Problem Statement