JCT
1998
13 years 11 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...