## Perfect f-Matchings and f-Factors in Hypergraphs - A Combinatorial Approach

Please always quote using this URN: urn:nbn:de:0297-zib-59071
under review
• We prove characterizations of the existence of perfect f-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the f-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the f-factor problem is NP-hard.

$Rev: 13581$