Non-bipartite matching lecture notes by MIT
= Non-bipartite matching lecture notes by MIT
https://math.mit.edu/~goemans/18433S07/edmonds.pdf
The final paragraph states <Tutte's theorem on perfect matchings> in terms of the number of components of <odd integer> order after deleting a <vertex> <subset>. The worked <perfect matching theorem for a cubic graph with at most two bridges> uses this criterion directly.