Score lists in multipartite hypertournaments
S. Pirzada, Guofei Zhou, Antal Iványi · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) · 2010
Given non-negative integers n i and α i with 0 ≤ α i ≤ n i (i = 1, 2, . . ., k), an [α 1 , α 2 , . . ., α k ]-k-partite hypertournament on k 1 n i vertices is a (k + 1)-tuple (U 1 , U 2 , . . ., U k , E), where U i are k vertex sets with |U i | = n i , and E is a set of k 1 α i -tuples of vertices, called arcs, with exactly α i vertices from U i , such that anyWe obtain necessary and sufficient conditions for k lists of nonnegative integers in non-decreasing order to be the losing score lists and to be the score lists of some k-partite hypertournament.