Domination numbers and noncover complexes of hypergraphs
Let H be a hypergraph on a finite set V. A cover of H is a set of vertices that meets all edges
of H. If W is not a cover of H, then W is said to be a noncover of H. The noncover complex of …
of H. If W is not a cover of H, then W is said to be a noncover of H. The noncover complex of …