A hypergraph version of the Gallai-Edmonds Theorem

DOI10.1016/j.endm.2007.01.052zbMath1291.05141OpenAlexW2021516413MaRDI QIDQ3439610

Ej Matštehlík

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.052

zbMATH Keywords

hypergraphmatching numberGallai-Edmonds decompositionexpansion number

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• t-expansive and t-wise intersecting hypergraphs
• Matching theory
• A generalisation of matching and colouring
• Paths, Trees, and Flowers
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A hypergraph version of the Gallai-Edmonds Theorem