论文部分内容阅读
A k-hypertournament H on n vertices with 2 ≤ k ≤ n is a pair H =(V, AH),where V is a set of n vertices and AH is a set of k-tuples of vertices, called arcs, such that for any k-subset S of V, AH contains exactly one of the k! k-tuples whose entries belong to S.Obviously, a 2-hypertournament is a tournament.