Tournament (graph theory)

维基百科

Landau's Theorem (1953) A nondecreasing sequence of integers {\displaystyle (s_{1},s_{2},\cdots ,s_{n})} is a score sequence if and only if :

1. {\displaystyle 0\leq s_{1}\leq s_{2}\leq \cdots \leq s_{n}}
2. {\displaystyle s_{1}+s_{2}+\cdots +s_{i}\geq {i \choose 2},{\mbox{for }}i=1,2,\cdots ,n-1}
3. {\displaystyle s_{1}+s_{2}+\cdots +s_{n}={n \choose 2}.}