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 | .
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01847459
Contributor : Giacomo Kahn <>
Submitted on : Friday, July 27, 2018 - 8:55:26 AM
Last modification on : Monday, March 30, 2020 - 8:44:43 AM
Document(s) archivé(s) le : Sunday, October 28, 2018 - 12:46:11 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

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

Citation

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

Share

Metrics

Record views

290

Files downloads

219