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

Alexandre Bazin; Laurent Beaudou; Giacomo Kahn; Kaveh Khoshkhah

Preprints, Working Papers, ...

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

Alexandre Bazin ¹ Laurent Beaudou ² Giacomo Kahn ³ Kaveh Khoshkhah ⁴

1 LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications

2 HSE-CS - National Research University Higher School of Economics, Faculty of Computer Science

3 DISP - Décision et Information pour les Systèmes de Production

4 CS - Institute of Computer Science (University of Tartu)

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

Keywords : Measure and conquer Formal Concept Analysis Hypergraphs Minimal transversal

Document type :

Preprints, Working Papers, ...

Domain :

Mathematics [math] / Combinatorics [math.CO]

Computer Science [cs] / Discrete Mathematics [cs.DM]

Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01847459
Contributor : Giacomo Kahn <>
Submitted on : Tuesday, January 5, 2021 - 11:12:35 AM
Last modification on : Monday, March 29, 2021 - 6:28:02 PM

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

Files

Identifiers

Collections

Citation

Export

Metrics

42

40

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

Files

Identifiers

Collections

Citation

Export

Share

Metrics

42

40