2023/01/10 by Karzanov, Alexander V.
#05C21 #91B10 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2301.04029
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.