The king chicken theorem also holds a cool proof. We will let \(x\) be a vertex with the most winnings or victories. Assume that vertex \(x\) beat all other vertices such that it has \(k\) winnings, therefore we say vertex \(x\) is a king. Now lets assume we have  vertex \(y\) such that \(y\rightarrow x\) and all other vertices but notice \(y\) has now defeated one more vertex than \(x\), that is \(y\) has defeated \(k+1\) vertices. This in fact contradicts the assumption about \(x\) having the most victories.