<div>The king chicken theorem is explained by having a tournament where&nbsp;<span class="ltx_Math" contenteditable="false" data-equation="x">\(x\)</span>&nbsp;is known as a king if&nbsp;<span class="ltx_Math" contenteditable="false" data-equation="x">\(x\)</span>&nbsp;can walk to every vertex in no more than two steps. The theorem also holds that every tournament has&nbsp;<span class="ltx_Math" contenteditable="false" data-equation="\ge1">\(\ge1\)</span>&nbsp;king chicken. This theorem was first introduced by Professor Steve Maurer who taught at Swarthmore College.&nbsp;<br></div>