Skip to main content
SpringerLink
Log in

2-Matchings and 2-covers of hypergraphs

  • Published:
Acta Mathematica Academiae Scientiarum Hungarica Aims and scope Submit manuscript

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

References

  1. C. Berge,Graphs and hypergraphs, North-Holland, 1973.

  2. D. R. Fulkerson, Anti-blocking polyhedra,J. Comb. Theory,B 12 (1972), 50–71.

    Google Scholar 

  3. T. Gallai, Über extreme Punkt- und Kantenmengen,Ann. Univ. Sci. Budapest Eötvös Sect. Math.,2 (1959), 133–138.

    Google Scholar 

  4. L. Lovász, Normal hypergraphs and the perfect graph conjecture,Discrete Math.,2 (1972), 253–267.

    Google Scholar 

  5. L. Lovász, Minimax theorems for hypergraphs,Proc. Hypergraph seminar in Columbus, Ohio.

  6. L. Lovász, On two minimax theorems in graph theory, to appear inJ. Comb. Th.

  7. W. T. Tutte, The factorization of linear graphs.J. London Math. Soc.,22 (1947), 107–111.

    Google Scholar 

  8. W. T. Tuite, The 1-factors of oriented graphs,Proc. Amer. Math. Soc.,4 (1953), 922–931.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Geometry, Eötvös Loránd University, Múzeum KRT. 6-8, 1088, Budapest, Hungary

    L. Lovász

Authors
  1. L. Lovász
    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

Lovász, L. 2-Matchings and 2-covers of hypergraphs. Acta Mathematica Academiae Scientiarum Hungaricae 26, 433–444 (1975). https://doi.org/10.1007/BF01902352

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation