For r -partite and for r -uniform hypergraphs bounds are given for the minimum degree which ensures d independent edges.
No takes yet. Share an insight, caveat, or question.
Daykin et al. (1981) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: