> Details

Bazin, Alexandre; Beaudou, Laurent; Kahn, Giacomo; Khoshkhah, Kaveh

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

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: E-Article
  • Title: Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
  • Contributor: Bazin, Alexandre; Beaudou, Laurent; Kahn, Giacomo; Khoshkhah, Kaveh
  • Published: Centre pour la Communication Scientifique Directe (CCSD), 2023
  • Published in: Discrete Mathematics & Theoretical Computer Science, vol. 23 no. 2, special issue... (2023) Special issues
  • Language: English
  • DOI: 10.46298/dmtcs.7129
  • ISSN: 1365-8050
  • Keywords: Discrete Mathematics and Combinatorics ; General Computer Science ; Theoretical Computer Science
  • Origination:
  • Footnote:
  • Description: <jats:p xml:lang="en">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.</jats:p>