Filtern
Erscheinungsjahr
- 2017 (1)
Dokumenttyp
- Artikel (1)
Sprache
- Deutsch (1)
Volltext vorhanden
- nein (1) (entfernen)
Gehört zur Bibliographie
- nein (1)
Institut
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.