Title of article
A hypergraph version of the Gallai-Edmonds Theorem
Author/Authors
Stehl?k، نويسنده , , Mat?j، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
5
From page
387
To page
391
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.
Keywords
Expansion number , Gallai-Edmonds decomposition , Hypergraph , matching number
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454611
Link To Document