Minimal covers of hypergraphs

Taras Banakh, Dominic van der Zypen

For a hypergraph $H=(V,\mathcal{E})$, a subfamily $\mathcal{C}\subseteq \mathcal{E}$ is called a cover of the hypergraph if $\bigcup \mathcal{C}=\bigcup \mathcal{E}$. A cover $\mathcal{C}$…