Title:
On Matchings and Covers

Thumbnail Image
Authors
Haxell, Penny
Authors
Advisors
Advisors
Associated Organizations
Organizational Unit
Organizational Unit
Collections
Supplementary to
Abstract
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 a cover of H in terms of the maximum size of a matching in H, for various classes of hypergraph H. For example, we consider r-partite hypergraphs and triangle hypergraphs.
Sponsor
NSF, NSA, ONR, IMA, Colleges of Sciences, Computing and Engineering
Date Issued
2012-05
Extent
Resource Type
Text
Resource Subtype
Proceedings
Rights Statement
Rights URI