Refine
Year of publication
- 2016 (1) (remove)
Has Fulltext
- no (1) (remove)
Institute
- Fachbereich Maschinenbau und Mechatronik (1) (remove)
We prove characterizations of the existence of perfect ƒ-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the ƒ-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 ƒ-factor problem is NP-hard.