Back to Discover
🔢

Matching (graph theory)

math Maturity 11-13

Imagine you have many friends.

Maximal-matching.svg
Maximal-matching.svg
You want to pick pairs to play. Each person can only be in one pair. We try to make as many pairs as we can. This helps everyone play together. Can you find all the pairs?
Maximum-matching-labels.svg
Maximum-matching-labels.svg

43 words
🖼️ Images & Media (2)
File:Maximal-matching.svg
Maximal-matching.svg
File:Maximum-matching-labels.svg
Maximum-matching-labels.svg
Up Next
🔢
Maximum-cardinality matching
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Maximum-cardinality matching 0% Edge cover 0% Kőnig's theorem (graph theory) 0% Bipartite graph 0% Vertex cover 0% Clique (graph theory) 0%

🔬 Go deeper

More advanced topics to explore

Bipartite graph Stable roommates problem Component (graph theory) Stable matching problem

🪜 Step back

Simpler topics to build understanding

Maximum-cardinality matching Edge cover Kőnig's theorem (graph theory) Vertex cover
📚 Content adapted from Wikipedia | Readability: FK 12.7 | Vital Level 5