# Perfect matching equivalence

There are so many things can be written…

Anyway, the following observation is really interesting; details can be found in the book “matching theory” by Lovasz and Plummer.

Consider a general graph $G$.  An equivalence relationship can be defined on the nodes of the graph as follows: two nodes $x$ and $y$ are equivalent if $G-x-y$ has no perfect matching(!).