In graph theory, directed graphs can be used to understand tournaments and theorems such as the king chicken theorem. First to understand the king chicken theorem, we will go over some terminology. A tournament is a directed graph that contains edges that have specific orientation. Tournament graphs are also used to show relationships between players and who beat who in a tournament. Complete graphs most often show this by using arrows. Any edge that points from \(i\) to \(j\) has directed orientation.