Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

1
  • $\begingroup$ If you're covering matching theory, I would add König's theorem (in a bipartite graph max matching + max independent set = #vertices), the theorem that a regular bipartite graph has a perfect matching, and Petersen's theorem that a bridgeless cubic graph has a perfect matching (e.g. a triangulated 2-manifold has a matching of its triangles). But I have to admit that last week in the matching part of my graph algorithms class I covered only König and Gale–Shapley because it's about graph algorithms not graph theory and I needed the remaining lecture time to cover the Hopcroft–Karp algorithm. $\endgroup$ Commented May 11, 2011 at 4:29