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

Alexandre Bazin (1) , Laurent Beaudou (2) , Giacomo Kahn (2) , Kaveh Khoshkhah (3)

1 Le2i - CheckSem
2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes
3 University of Tartu

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 | .

Mots clés: Hypergraph Transversals; (k; k)-Hypergraphs; (3; 3)-Hypergraphs; Polyadic Concept Analysis; Triadic Concept Analysis; Measure and Conquer

Domaines: Combinatoire [math.CO]; Mathématique discrète [cs.DM]

Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah. Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. 2018. ⟨hal-01847459v2⟩