Extremal hypergraphs for matching number and domination number

Erfang Shan, Yanxia Dong, Liying Kang +1

A matching in a hypergraph $\mathcal{H}$ is a set of pairwise disjoint hyperedges. The matching number $\nu (\mathcal{H})$ of $\mathcal{H}$ is the size of a maximum matching in $\math…