Skip to main content
SpringerLink
Log in

Fractional matchings and covers in infinite hypergraphs

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

A strong version of the duality theorem of linear programming is proved for fractional covers and matchings in countable graphs. It is conjectured to hold for general hypergraphs. In Section 2 we show that in countable hypergraphs there does not necessarily exist a maximal matchable set, contrary to the situation in graphs.

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. L. Lovász, 2-matchings and 2-covers of hypergraphs,Acta Math. Ac. Sc. Hung.,26 (1975) 433–444.

    Article  MATH  Google Scholar 

  2. K. P. Podewski andK. Steffens, Injective choice functions for countable families,J. Comb. Th. Ser. B,21 (1976), 165–179.

    MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, Technion — HT, 32000, Haifa, Israel

    Ron Aharoni

Authors
  1. Ron Aharoni
    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

Aharoni, R. Fractional matchings and covers in infinite hypergraphs. Combinatorica 5, 181–184 (1985). https://doi.org/10.1007/BF02579360

Download citation

  • Received:

  • Issue Date:

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

AMS subject classification (1980)

Search

Navigation