Refine
Year of publication
- 2017 (1)
Document Type
- Article (1)
Language
- German (1) (remove)
Has Fulltext
- no (1)
Is part of the Bibliography
- no (1)
Institute
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.