Matching (graph theory)
Set of edges without common vertices / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Matching (graph theory)?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
For comparisons of two graphs, see Graph matching.
In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices.[1] 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 network flow problem.