  Consider the stable matching problem on two sets. We introduce the concept of
a preference cycle and show how its natural presence in stable matchings proves
a series of classical results in an elementary way.
