Skip to main content
SpringerLink
Log in

A condition for matchability in hypergraphs

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

An extension of Hall's theorem is proved, which gives a condition for complete matchings in a certain class of hypergraphs.

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. Aharoni, R.: Matchings inn-partiten-graphs. Graphs and Combinatorics1, 303–304 (1985)

    Google Scholar 

  2. Aharoni, R.: On a criterion for matching in hypergraphs. Graphs and Combinatorics9, 209–212 (1993)

    Google Scholar 

  3. Aharoni, R., Kessler, O.: On a possible extension of Hall's theorem to bipartite hypergraphs. Discrete Math.84, 309–313 (1990)

    Google Scholar 

  4. Kessler, O.: Matchings in hypergraphs, DSc thesis, Technion, 1989

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada

    P. E. Haxell

Authors
  1. P. E. Haxell
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research partially supported by NSERC.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haxell, P.E. A condition for matchability in hypergraphs. Graphs and Combinatorics 11, 245–248 (1995). https://doi.org/10.1007/BF01793010

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation