Perfect 1-Factorisations A matching in a graph $G$ is a subset $M \subseteq E(G)$ of the edge set of $G$ such that no two edges of $M$ share a vertex. A 1-factor of a graph $G$ is a matching $F$