The Gale-Shapley algorithm is a well known solution to this problem. You should look it up
I have d-regular bipartite graph with two sets, each link has one edge in one set and another edge in second set. Graph has preference relations.
How can I prove that graph contains stable matching cardinality at least d?
Thank you in advance!