A graph G = (V, E) has perfect matching if and only if, for any subset U of the vertex set V, the number of connected components with odd vertices in the subgraph induced by V - U is at most |U|.
This page is auto-translated from [/nishio/Tutte の定理](https://scrapbox.io/nishio/Tutte の定理) using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.