| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652862 | Electronic Notes in Discrete Mathematics | 2007 | 5 Pages |
Abstract
A matching-cover of a hypergraph H is a matching F such that V(F)=V(H) and every edge of F is contained in an edge of H. This generalises the notion of a matching in a graph. We use this concept to extend the Gallai-Edmonds Theorem to hypergraphs, and deduce a number of interesting corollaries.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
