Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2023

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.4977^n and at most like 1.5012^n.
Fichier principal
Vignette du fichier
Bounding_MTs_in_hypergraphs_final.pdf (299.48 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)

Licence

Paternité

Identifiants

Citer

Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah. Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. Discrete Mathematics and Theoretical Computer Science, 2023, vol. 23 no. 2, special issue in honour of Maurice Pouzet, ⟨10.46298/dmtcs.7129⟩. ⟨hal-01847459v7⟩
455 Consultations
511 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More