Prove or Disprove:
A k-regular bipartite graph (a bipartite graph where every vertex has degree k) has at least k! perfect matchings.
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
-1
|
|
||||||||
|
