  A firm-worker hypergraph consists of edges in which each edge joins a firm
and its possible employees. We show that a stable matching exists in both
many-to-one matching with transferable utilities and discrete many-to-one
matching when the firm-worker hypergraph has no nontrivial odd-length cycle.
Firms' preferences satisfying this condition arise in a problem of matching
specialized firms with specialists.
