The king chicken theorem is explained by having a tournament where \(x\) is known as a king if \(x\) can walk to every vertex in no more than two steps. The theorem also holds that every tournament has \(\ge1\) king chicken. This theorem was first introduced by Professor Steve Maurer who taught at Swarthmore College.