1 problem

Let $Q_n$ be the $n$-dimensional hypercube. A maximal matching is a matching that cannot be enlarged by adding an edge. For a matching $M$ and a vertex $u$ covered by $M$, let…