Matching criticality in intersecting hypergraphs

Liying Kang, Zhenyu Ni, Erfang Shan

A matching in a hypergraph $H$ is a set of pairwise vertex disjoint edges in $H$ and the matching number of $H$ is the maximum cardinality of a matching in $H$. A transversal in $H…