Editing Matching (graph theory) (section)

{{Short description|Set of edges without common vertices}}
{{for|comparisons of two graphs|Graph matching}}

In the mathematical discipline of [[graph theory]], a '''matching''' or '''independent edge set''' in an undirected [[Graph (discrete mathematics)|graph]] is a set of [[Edge (graph theory)|edges]] without common [[vertex (graph theory)|vertices]].<ref name="NetworkX 2.8.2 documentation">{{cite web | title=is_matching | website=NetworkX 2.8.2 documentation | url=https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.matching.is_matching.html#networkx.algorithms.matching.is_matching | access-date=2022-05-31 | quote=Each node is incident to at most one edge in the matching. The edges are said to be independent.}}</ref> In other words, a subset of the edges is a matching if each vertex appears in at most one edge of that matching. Finding a matching in a [[bipartite graph]] can be treated as a [[Flow network|network flow]] problem.

{{Covering-Packing_Problem_Pairs}}