@article{BeckenbachScheidweiler, author = {Beckenbach, Isabel and Scheidweiler, Robert}, title = {Perfect f-Matchings and f-Factors in Hypergraphs - A Combinatorial Approach}, series = {Discrete Mathematics}, volume = {340}, journal = {Discrete Mathematics}, number = {10}, doi = {10.1016/j.disc.2017.05.005}, pages = {2499 -- 2506}, abstract = {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.}, language = {de} }