There are various on-line references to Pecking Order & Kings & Emperors,
on the 'Net and elsewhere. Your cite asks for a proof of Theorem 1.
This is easy by induction: Just show that if K is a King of Flock F, then
either K or T will be a King of (F union {T}).
More interesting is Theorem 4. What makes this "fun" is that, as I wrote,
> > The challenge is to prove Theorem 4.
> > What makes this interesting is that there is a Theorem 3 which is much
> > easier to prove than Theorem 4, but for which Theorem 4 is an easy
> > corollary. Can you guess the secret Theorem 3
> > which assists this proof?
jamesdowallen at Gmail