Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges

M. Aaghabali, S. Akbari, S. Friedland +2

We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2…