Score sets in \(k\)-partite tournaments (Q854436)

The set of distinct scores (outdegrees) of the vertices of a \(k\)-partite tournament is called its score set. The paper shows that every set of \(n\) nonnegative integers, except \(\{0\}\) and \(\{0, 1\}\), is a score set of some 3-partite tournament, and that every set of \(n\) nonnegative integers is a score set of some \(k\)-partite tournament for every \(k\) bounded between \(n\) and 2.