Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs

We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergraphs, a class commonly found in applications dealing with data. Let H be such a  hypergraph on a set of vertices V. We give a lower bound of 1.4977 |V | and an upper bound of  1.5012 |V | .