Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

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 | .
Document type :
Preprints, Working Papers, ...
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

Files

Identifiers

  • HAL Id : hal-01847459, version 3
  • ARXIV : 1807.09030

Citation

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

Share

Metrics

Record views

42

Files downloads

40