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

来源：

Discrete Mathematics and Theoretical Computer Science | 2023年 / 23卷 / 02期

关键词：

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).

引用

共 50 条

[1] Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
Bazin, Alexandre
Beaudou, Laurent
Kahn, Giacomo
Khoshkhah, Kaveh
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (02):
[2] On the number of minimal transversals in 3-uniform hypergraphs
Lonc, Zbigniew
Truszczynski, Miroslaw
DISCRETE MATHEMATICS, 2008, 308 (16) : 3668 - 3687
[3] Transversals and matchings in 3-uniform hypergraphs
Henning, Michael A.
Yeo, Anders
EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (02) : 217 - 228
[4] On upper transversals in 3-uniform hypergraphs
Henning, Michael A.
Yeo, Anders
ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (04):
[5] Affine Planes and Transversals in 3-Uniform Linear Hypergraphs
Henning, Michael A.
Yeo, Anders
GRAPHS AND COMBINATORICS, 2021, 37 (03) : 867 - 890
[6] Affine Planes and Transversals in 3-Uniform Linear Hypergraphs
Michael A. Henning
Anders Yeo
Graphs and Combinatorics, 2021, 37 : 867 - 890
[7] ON ORDERED RAMSEY NUMBERS OF TRIPARTITE 3-UNIFORM HYPERGRAPHS
Balko, Martin
Vizer, Mate
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (01) : 214 - 228
[8] Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
Bryant, Darryn
Herke, Sarada
Maenhaut, Barbara
Wannasit, Wannasiri
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2014, 60 : 227 - 254
[9] On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs
Tang, Zhongzheng
Tang, Yucong
Diao, Zhuo
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 687 - 700
[10] The Ramsey number of loose paths in 3-uniform hypergraphs
Maherani, Leila
Omidi, Golam Reza
Raeisi, Ghaffar
Shahsiah, Maryam
ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (01):

← 1 2 3 4 5 →