Tournament


Definition

"An important type of digraph is a tournament. This is a digraph in which any two vertices are joined by exactly one arc ..." A digraph in which any two vertices are joined by exactly one arc.
THEOREM    "An important type of digraph is a tournament. ... its underlying graph is a complete graph." Theorem: The underlying graph of a tournament is a complete graph.

Proof unavailable

Proper supersets