A widely known tournament graph is based off of the king chicken theorem where \(x\) is known to be a king chicken if for each opponent \(y,\) we either have the case  \(x\rightarrow y\) or there exists another player \(z\) in which case \(x\rightarrow y\rightarrow z.\) A king exists if a player can walk to a designated vertex in at most two steps. For example,