Some hypergraphs and packing problems associated with matrices of 0's and 1's

Abstract We define various classes of hypergraphs associated with m × n matrices of 0's and 1's and determine for which classes the maximum cardinality of a set of pairwise disjoint edges equals the minimum cardinality of a set of nodes that cover all edges independently of the matrix.