A new perspective from hypertournaments to tournaments

Jiangdong Ai, Qiming Dai, Qiwen Guo +2

A $k$-tournament $H$ on $n$ vertices is a pair $(V,A)$ for $2\le k\le n$, where $V(H)$ is a set of vertices, and $A(H)$ is a set of all possible $k$-tuples of vertices, such tha…