Now showing items 1-1 of 1
On Matchings and Covers
(Georgia Institute of Technology, 2012-05)
Let H be a hypergraph. A matching in H is a set of pairwise disjoint edges of H. A cover of H is a set C of vertices that meets all edges of H. We discuss a number of conjectures and results that bound the minimum size of ...