Graphs and Combinatorics

, Volume 4, Issue 1, pp 115-206

First online:

Matchings and covers in hypergraphs

  • Zoltán FürediAffiliated withAT&T Bell Laboratories Murray HillDepartment of Mathematics, M.I.T.

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Almost all combinatorial question can be reformulated as either a matching or a covering problem of a hypergraph. In this paper we survey some of the important results.