Total domination of graphs and small transversals of hypergraphs (Q949753): Difference between revisions

This paper proves the upper bound \((5n+4m)/21\) on the cardinality of a minimal transversal of a 4-uniform hypergraph with \(n\) vertices and \(m\) edges. In case of \(n=m\) it turns to \(3n/7\) and it is sharp. The paper proves some sharp results on the domination number of graphs with minimum degree 3 and 4, respectively.