Cseh, Ágnes; Kavitha, Telikepalli - 2017
matchings called "dominant matchings" and show that if there is a popular matching that contains the edge e, then there is … popular matching containing a given set of edges or report that none exists, where n = |A| + |B|. …Given a bipartite graph G=(A B, E) with strict preference lists and given an edge e E, we ask if there exists a popular …