Prefer a chat interface with context about you and your work?
Matchings in Countable Graphs
Tutte [ 9 ] has given necessary and sufficient conditions for a finite graph to have a perfect matching. Different proofs are given by Brualdi [ 1 ] and Gallai [ 2 ; 3 ]. The shortest proof of Tutte's theorem is due to Lovasz [ 5 ]. In another …