While reviewing graph theory, I came across a problem that I could not solve. The first part of the question asked one to prove that the n-cube has a perfect matching. This seemed to be a consequence of Hall's Theorem also described here:
However, I am not sure as to how to start to enumerate how many perfect matching are in total. Any help would be much appreciated!