Skip to main content
SpringerLink
Log in

Maximal tight sets and the edmonds—Gallai decomposition for matchings

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

The Edmonds—Gallai decomposition theorem for matchings of finite or locally finite graphs is generalized to matchings of the kernel of an arbitrary graph.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Aharoni, On an obstruction for perfect matchings,Combinatorica,4 (1984), 1–6.

    MATH  MathSciNet  Google Scholar 

  2. R. Aharoni, A generalization of Tutte’s 1-factor theorem to countable graphs,J. Comb. Th. (B) 37 (1984), 199–209.

    Article  MATH  MathSciNet  Google Scholar 

  3. F. Bry andM. Las Vergnas, The Edmonds—Gallai decomposition for matchings in locally finite graphs,Combinatorica,2 (1982), 229–235.

    MATH  MathSciNet  Google Scholar 

  4. J. Edmonds, Paths, trees and flowers,Can. J. Math.,17 (1965), 449–467.

    MATH  MathSciNet  Google Scholar 

  5. T. Gallai, Maximale Systeme unabhängiger Kanten,Mat. Kut. Int. Közl.,9 (1964), 373–395.

    Google Scholar 

  6. T. Gallai, On factorization of graphs,Acta Math. Acad. Sci. Hungar.,1 (1950), 133–153.

    Article  MATH  MathSciNet  Google Scholar 

  7. F. Harary,Graph Theory, Addison—Wesley 1969.

  8. L. Lovász, On the structure of factorizable graphs,Acta Math. Acad. Sci, Hung.,23 (1972), 179–185.

    Article  MATH  Google Scholar 

  9. R. Schmidt,Ein Reduktionsverfahren für Weg-endliche Graphen, Dissertation, Hamburg 1982.

    MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inst. für Mathematik, Universität Hannover, Welfengarten 1, 3000, Hannover, Germany

    K. Steffens

Authors
  1. K. Steffens
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Steffens, K. Maximal tight sets and the edmonds—Gallai decomposition for matchings. Combinatorica 5, 359–365 (1985). https://doi.org/10.1007/BF02579252

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS subject classification (1980)

Search

Navigation