Fachbereich Maschinenbau und Mechatronik
Refine
Keywords
- Balanced hypergraph (1)
- Duality (1)
- Hall’s Theorem (1)
- Hypergraph (1)
- Koenig’s Theorem (1)
- Matching (1)
- Vertex cover (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.