Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653468 | European Journal of Combinatorics | 2015 | 13 Pages |
Abstract
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-factors in a directed complete bipartite balanced graph on 2n2n vertices. The upper bound is sharp for even nn. For odd nn we state a conjecture on a sharp upper bound.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
M. Aaghabali, S. Akbari, S. Friedland, K. Markström, Z. Tajfirouz,