Back to Discover
🔢

Kőnig's theorem (graph theory)

math Maturity 7-9

Dots can be joined by lines.

Koenigs-theorem-graph.svg
Koenigs-theorem-graph.svg
You can pair them up. You can also pick dots to touch every line. In some groups, these two numbers are the same. It is a neat trick! Can you find the pairs?

40 words
🖼️ Images & Media (2)
File:Koenigs-theorem-graph.svg
Koenigs-theorem-graph.svg
File:Minimum cut in a bipartite graph.svg
Minimum cut in a bipartite graph.svg
Up Next
🔢
Bipartite graph
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Bipartite graph 0% Maximum-cardinality matching 0% Edge cover 0% Vertex cover 0% Vizing's theorem 0% Matching (graph theory) 0%

🔬 Go deeper

More advanced topics to explore

Bipartite graph Maximum-cardinality matching Vertex cover Matching (graph theory)

🪜 Step back

Simpler topics to build understanding

Edge cover Vizing's theorem Assignment problem Turán's brick factory problem
📚 Content adapted from Wikipedia | Readability: FK 12.3 | Vital Level 5