Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

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

Résumé

We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications. In this paper we prove that this number grows at least like 1:4977n and at most like 1:5012n.
Fichier principal
Vignette du fichier
Bounding_the_Number_of_Minimal_Transversals_in_Tripartite_3_Uniform_Hypergraphs20220128.pdf (416.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01847459 , version 1 (23-07-2018)
hal-01847459 , version 2 (27-07-2018)
hal-01847459 , version 3 (05-01-2021)
hal-01847459 , version 4 (03-01-2022)
hal-01847459 , version 5 (28-01-2022)
hal-01847459 , version 6 (14-10-2022)
hal-01847459 , version 7 (06-04-2023)

Identifiants

Citer

Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah. Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. 2022. ⟨hal-01847459v5⟩
456 Consultations
520 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More