科研之友
微信
新浪微博
Facebook
分享链接
摘要
A bipartite graph G=(A,B) is said to have positive surplus (as viewed from A) if the number of neighbors of X is bigger than the size of X for any non-empty subset X of A. In this paper, two lower bounds on the number of maximum matchings in bipartite graphs with positive surplus are obtained. The enumeration problems for maximum matchings in special bipartite graphs are solved. From this, the number of perfect matchings of some elementary bipartite graphs is given.
