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

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.

Podrobná bibliografie

Vydáno v:	Discrete mathematics and theoretical computer science Ročník 23 no. 2, special issue...; číslo Special issues
Hlavní autoři:	Bazin, Alexandre, Beaudou, Laurent, Kahn, Giacomo, Khoshkhah, Kaveh
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	DMTCS 20.04.2023 Discrete Mathematics & Theoretical Computer Science
Témata:	[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] [math.math-co]mathematics [math]/combinatorics [math.co] Combinatorics Computer Science Discrete Mathematics hypergraphs Mathematics measure and conquer minimal transversal Measure and conquer Hypergraphs Minimal transversal
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!