Theorem 3.2
(Kahn-Lovasz)
.
Assuming that:
G
a graph with
2
n
vertices
Then
the number of
1
-factors
in
G
is at most
∏
x
∈
V
(
G
)
(
d
(
x
)
!
)
1
2
d
(
x
)
.