 Maximum cardinality matching

Maximum cardinality matching is a concept in graph theory referring to a matching (a set of edges without common vertices) that includes the maximum number of edges possible. In a simple undirected graph, a matching pairs up vertices such that no two edges share a vertex. ### Key Points: 1. **Matching**: A matching in a graph is a set of edges where no two edges share a vertex.