## Number of Matchings in Regular Bipartite Graph

Prove or Disprove:

A k-regular bipartite graph (a bipartite graph where every vertex has degree k) has at least k! perfect matchings.

-
Is this homework? – Gjergji Zaimi Mar 4 at 19:07
It was originally a homework problem, but then a problem was discovered in the staff solution. Now both I and the instructor are curious about other possible solutions. – unknown (google) Mar 8 at 0:29