Note on the degree sequences of \(k\)-hypertournaments (Q2483417)

A \(k\)-hypertournament is a collection of \(n \choose k\) \(k\)-variations (where each subset occurs exactly once). The degree of vertex \(v\) in the (ordered) arc s \(k\) minus its place in the arc. The degree of \(v\) in the \(k\)-hypertournament is the sum of its degree in each arc. This new notion is a generalization of the so called score sequence (defined in 1953). The paper proves an Erdős-Gallai type condition for an integer sequence to be a degree sequence of a \(k\)-hypertournament.