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 条
  • [41] 3-UNIFORM HYPERGRAPHS AND LINEAR CYCLES
    Ergemlidze, Beka
    Gyori, Ervin
    Methuku, Abhishek
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (02) : 933 - 950
  • [42] A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
    Diao, KF
    Liu, GZ
    Rautenbach, D
    Zhao, P
    DISCRETE MATHEMATICS, 2006, 306 (07) : 670 - 672
  • [43] Decompositions of the 3-uniform hypergraphs Kv(3) into hypergraphs of a certain type
    Tao Feng
    Yan-xun Chang
    Science in China Series A: Mathematics, 2007, 50 : 1035 - 1044
  • [44] Decompositions of the 3-uniform hypergraphs Kv(3) into hypergraphs of a certain type
    Feng, Tao
    Chang, Yan-xun
    SCIENCE IN CHINA SERIES A-MATHEMATICS, 2007, 50 (07): : 1035 - 1044
  • [45] On the rainbow matching conjecture for 3-uniform hypergraphs
    Gao, Jun
    Lu, Hongliang
    Ma, Jie
    Yu, Xingxing
    SCIENCE CHINA-MATHEMATICS, 2022, 65 (11) : 2423 - 2440
  • [46] BIG RAMSEY DEGREES OF 3-UNIFORM HYPERGRAPHS
    Balko, M.
    Chodounsky, D.
    Hubicka, J.
    Konecny, M.
    Vena, L.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 415 - 422
  • [47] On line graphs of linear 3-uniform hypergraphs
    Metelsky, Y
    Tyshkevich, R
    JOURNAL OF GRAPH THEORY, 1997, 25 (04) : 243 - 251
  • [48] Quasirandomness, counting and regularity for 3-uniform hypergraphs
    Gowers, WT
    COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (1-2): : 143 - 184
  • [49] Counting small cliques in 3-uniform hypergraphs
    Peng, Y
    Rödl, V
    Skokan, J
    COMBINATORICS PROBABILITY & COMPUTING, 2005, 14 (03): : 371 - 413
  • [50] Edge-coloring of 3-uniform hypergraphs
    Obszarski, Pawel
    Jastrzebski, Andrzej
    DISCRETE APPLIED MATHEMATICS, 2017, 217 : 48 - 52
12345