 Tournament (graph theory)

In graph theory, a **tournament** is a special type of directed graph (digraph) that represents the outcomes of pairwise competitions among a set of participants. Specifically, a tournament consists of a finite set of vertices, where each vertex represents a participant, and for every pair of distinct vertices \(u\) and \(v\), there is exactly one directed edge.