  I relate bipartite graph matchings to stable matchings. I prove a necessary
and sufficient condition for the existence of a saturating stable matching,
where every agent on one side is matched, for all possible preferences. I
extend my analysis to perfect stable matchings, where every agent on both sides
is matched.
