共 50 条
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
被引:0
|作者:
Bazin A.
[1
]
Beaudou L.
[2
]
Kahn G.
[3
]
Khoshkhah K.
[4
]
机构:
[1] Université de Montpellier, CNRS, LIRMM, Montpellier
[2] Université Clermont Auvergne, Clermont Auvergne INP, CNRS, Mines Saint-Etienne, LIMOS, Clermont-Ferrand
[3] Univ Lyon, Univ Lumière Lyon 2, INSA Lyon, Université Claude Bernard Lyon 1, DISP, EA4570, Bron
[4] Institute of Computer Science, University of Tartu, Tartu
来源:
关键词:
conquer;
hypergraphs;
measure;
Minimal transversals;
D O I:
10.46298/DMTCS.7129
中图分类号:
学科分类号:
摘要:
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 © 2023 by the author(s).
引用
收藏
相关论文