Matchings in balanced hypergraphs

Details Matchings in balanced hypergraphs Matchings in balanced hypergraphs

2009-10-22

arxiv.org/abs/0910.4197v1

Mathematics

Combinatorics

10 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Matchings in balanced hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Matchings in balanced hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matchings in balanced hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-689754