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
School of Computer Science and Informatics [Dublin], Le2i - Laboratoire Electronique, Informatique et Image [UMR6303]
2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes
3 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 : Hypergraph Transversals (k k)-Hypergraphs (3 3)-Hypergraphs Polyadic Concept Analysis Triadic Concept Analysis Measure and Conquer
Document type :
Preprints, Working Papers, ...
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, January 20, 2020 - 12:14:06 PM
Long-term archiving on: 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

Collections

CNRS | INSMI | ICB | LE2I | LIMOS | TDS-MACS | UNIV-BOURGOGNE | PRES_CLERMONT | UNIV-HESAM

Citation

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

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

270

Files downloads

179

Contact

Informations

CCSD