Theorem 3.1
(Bregman)
.
Assuming that:
G
a bipartite graph with vertex sets
X
,
Y
of size
n
Then
the number of perfect matchings in
G
is at most
∏
x
∈
X
(
d
(
x
)
!
)
1
d
(
x
)
.