Sharp lower bounds for the number of maximum matchings in bipartite multigraphs

Alexandr V. Kostochka, Douglas B. West, Zimu Xiang

We study the minimum number of maximum matchings in a bipartite multigraph G with parts $X$ and $Y$ under various conditions, refining the well-known lower bound due to M. Hall. Wh…