Are disjoint edges the same as matchings? I am reading Chapter 9 Approximation Algorithms of Dasgupts et al.'s Algorithm book for vertex cover approximation and they bring up the concept of matchings.
To support this, I am also watching Coursera's Approximation algorithms course by EIT digital.
This video mentions using disjoint edges and would like to confirm that the 2 are actually the same and I am not missing and subtle details.
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.