New answers tagged

1 vote

Minimum number of perfect matchings in a regular bipartite graph

as already mentioned in the comments, that is answered by Alexander Schrijver in his publication "Counting 1-factors in regular bipartite graphs": any $k$-regular bipartite graph with $2n$ ...
user avatar

Top 50 recent answers are included