On the Number of Matchings in Regular Graphs

S. Friedland, E. Krop, K. Markström

For the set of graphs with a given degree sequence, consisting of any number of $2^{\prime }s$ and $1^{\prime }s$, and its subset of bipartite graphs, we characterize the optimal graphs who maximize…