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