Skip to main content
Log in

On an obstruction for perfect matchings

  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Aharoni, On the equivalence of two conditions for the existence of transversals,J. Comb. Th. Ser. A.,34 (1983), 202–214.

    Article  MathSciNet  Google Scholar 

  2. R. Aharoni, Matchings in graphs of size ℵ1, submitted for publication.

  3. K. Steffens, Matchings in countable graphs,Can. J. Math. 29 (1976), 165–168.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Dedicated to Paul Erdős on his seventieth birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aharoni, R. On an obstruction for perfect matchings. Combinatorica 4, 1–6 (1984). https://doi.org/10.1007/BF02579151

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579151

AMS subject classification (1980)