Minimal-to-Maximal Conversion Search Is Not Output-Polynomial

Bennet Hörmann, Martin Schirneck

The Transversal Hypergraph problem is to enumerate (list) all inclusion-wise minimal hitting sets of a given hypergraph $\mathcal{H}$. It is the most important open question in enu…