  We prove lower bounds for the fraction of edges of an $r$-graph which can be
covered by the union of $k$ 1-factors. The special case $r=3$ yields some known
results for cubic graphs. Furthermore, we introduce the concept of
$k$-overfull-free $r$-graphs and achieve better bounds for these graphs.
