Abstract
Given non-negative integers and with , an --partite hypertournament on vertices is a -tuple , where are vertex sets with , and is a set of -tuples of vertices, called arcs, with exactly vertices from , such that any subset of , contains exactly one of the -tuples whose entries belong to . We obtain necessary and sufficient conditions for lists of non-negative integers in non-decreasing order to be the losing score lists and to be the score lists of some -partite hypertournament.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.