We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications. In this paper we prove that this number grows at least like 1.4977^n and at most like 1.5012^n.
No takes yet. Share an insight, caveat, or question.
Bazin et al. (2023) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: