Perfect matchings in balanced hypergraphs (Q2563509)

A hypergraph \(H(V,E)\) is balanced if every odd cycle \(C\) of \(H\) has an edge containing at least three nodes of \(C\). The main result of the present paper is the following generalization of a theorem of Hall: A balanced hypergraph \(H(V,E)\) has no perfect matching if and only if there exist disjoint node sets \(R\) and \(B\) such that \(|B|>|R|\) and every edge contains at least as many nodes in \(R\) as in \(B\).