Matchings in multipartite hypergraphs

Candida Bowtell, Richard Mycroft

A folklore result on matchings in graphs states that if $G$ is a bipartite graph whose vertex classes $A$ and $B$ each have size $n$, with $\mathrm{deg}(u)\ge a$ for every $u \in…