On the set of stable matchings of a bipartite graph

The topic of stable matchings (marriages) in a bipartite graph has become widely popular, starting with the appearance of the classical work by Gale and Shapley. We give a detailed survey on selected known results in this field that demonstrate structural, polyhedral and algorithmic properties of such matchings and their sets, providing our description with relatively short proofs.