Consider an instance of the Stable Matching Problem in which

there exists a man m and a woman w such that m is ranked first on the

preference list of w and w is ranked first on the preference list of m$.$ Then in

every stable matching S for this instance, the pair $($m$,$ w$)$ belongs to S$.$