On Score Sequences ofk-Hypertournaments


Given two nonnegative integers n and k with n ≥ k > 1, a k-hypertournament on n vertices is a pair (V, A), where V is a set of vertices with |V | = n and A is a set of k-tuples of vertices, called arcs, such that for any k-subset S of V , A contains exactly one of the k! k-tuples whose entries belong to S. We show that a nondecreasing sequence (r1, r2… (More)
DOI: 10.1006/eujc.2000.0393