Discrete MathematicsVolume 64, Issues 2–3, April 1987, Pages 229-237A compactness result for perfect matchingsAuthor links open overlay panelNorbert PolatShow moreShareCitehttps://doi.org/10.1016/0012-365X(87)90192-0Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe show that an infinite set system (V, E), for which E is a subspace of the vector space of all finite subsets of V, has a perfect matching if and only if every finite subset of V is covered by a matching of (V, E).Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1987 Published by Elsevier B.V.