Domination in intersecting hypergraphs

Yanxia Dong, Erfang Shan, Shan Li +1

A matching in a hypergraph $H$ is a set of pairwise disjoint hyperedges. The matching number ${\alpha }^{\prime }(H)$ of $H$ is the size of a maximum matching in $H$. A subset $D$ of vertices of $H…