Perfect ƒ-Matchings and ƒ-Factors in Hypergraphs - A Combinatorial Approach
- 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.
| Author: | Isabel Beckenbach, Robert Scheidweiler |
|---|---|
| DOI: | https://doi.org/10.1016/j.disc.2017.05.005 |
| ISSN: | 2192-7782 |
| Parent Title (English): | Discrete Mathematics |
| Publisher: | Elsevier |
| Place of publication: | Amsterdam |
| Document Type: | Article |
| Language: | English |
| Year of Completion: | 2016 |
| Date of the Publication (Server): | 2016/11/08 |
| Volume: | 240 |
| Issue: | 10 |
| First Page: | 2499 |
| Last Page: | 2506 |
| Note: | Als Volltext auch bei ZIB (Zuse Institute Berlin) |
| Link: | https://doi.org/10.1016/j.disc.2017.05.005 |
| Link: | PDF bei ZIB (Zuse Institute Berlin) herunterladen |
| Zugriffsart: | campus |
| Institutes: | FH Aachen / Fachbereich Maschinenbau und Mechatronik |
| collections: | Verlag / Elsevier |
