Matchings in balanced hypergraphs

Matchings in balanced hypergraphs

We give a new proof of K\"onig's theorem and generalize the Gallai-Edmonds decomposition to balanced hypergraphs in two different ways. Based on our decompositions we give two new characterizations of balanced hypergraphs and show some properties of matchings and vertex cover in balanced h...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2009-10
Hauptverfasser: Scheidweiler, Robert, Triesch, Eberhard
Format: Artikel
Sprache:eng
Schlagworte:
Decomposition
Graph theory
Graphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We give a new proof of K\"onig's theorem and generalize the Gallai-Edmonds decomposition to balanced hypergraphs in two different ways. Based on our decompositions we give two new characterizations of balanced hypergraphs and show some properties of matchings and vertex cover in balanced hypergraphs.
ISSN:2331-8422