Graph Theory Questions
A matching in a graph is a set of edges in which no two edges share a common vertex. In other words, it is a subset of the edges of the graph such that no two edges are adjacent.