3 research outputs found
A new perspective from hypertournaments to tournaments
A -tournament on vertices is a pair for ,
where is a set of vertices, and is a set of all possible
-tuples of vertices, such that for any -subset of ,
contains exactly one of the possible permutations of . In this paper,
we investigate the relationship between a hyperdigraph and its corresponding
normal digraph. Particularly, drawing on a result from Gutin and Yeo, we
establish an intrinsic relationship between a strong -tournament and a
strong tournament, which enables us to provide an alternative (more
straightforward and concise) proof for some previously known results and get
some new results.Comment: 10 page