Skip to main content
Springer Nature Link
Log in

Matchings inn-partiten-graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A generalization of Hall's theorem is proved for fractional matchings inn-partiten-regular hypergraphs.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, Technion-Israel Institute of Technology, 32000, Technion City Haifa, Israel

    Ron Aharoni

Authors
  1. Ron Aharoni
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was done while the author visited AT&T Bell Laboratories, Murray Hill, New Jersey, USA.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aharoni, R. Matchings inn-partiten-graphs. Graphs and Combinatorics 1, 303–304 (1985). https://doi.org/10.1007/BF02582958

Download citation

  • Issue Date:

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

Keywords