Is there a lower bound on the number of perfect matchings in a $k$-regular bipartite graph?

One can use Hall's marriage theorem and induction on $k$ to derive the lower bound of $k$. I can't come up with an example where this bound is actually tight. Is there a better lower bound than this?