Abstract
Steffens [3] introduced a substructure (called below a “compressed set”) which prevents a graph from having a perfect matching, and proved that a countable graph possesses a perfect matching if and only if it does not contain such a substructure. In this paper we study some properties of compressed sets.
Similar content being viewed by others
References
R. Aharoni, On the equivalence of two conditions for the existence of transversals,J. Comb. Th. Ser. A.,34 (1983), 202–214.
R. Aharoni, Matchings in graphs of size ℵ1, submitted for publication.
K. Steffens, Matchings in countable graphs,Can. J. Math. 29 (1976), 165–168.
Author information
Authors and Affiliations
Additional information
Dedicated to Paul Erdős on his seventieth birthday