Are disjoint edges the same as matchings?
Two disjoint edges $(a,b)$ and $(c,d)$ are edges that do not share any endpoint, i.e., $\{a,b\} \cap \{c,d\} = \emptyset$. A matching is a set of pairwise disjoint edges.