For questions about matchings in graph theory. A matching on a graph is a set of edges such that no two edges share a common vertex.
For questions about matchings in graph theory. A matching on a graph is a set of edges such that no two edges share a common vertex.