TY - JOUR
T1 - On the number of minimal transversals in 3-uniform hypergraphs
AU - Lonc, Zbigniew
AU - Truszczyński, Mirosław
PY - 2008/8/28
Y1 - 2008/8/28
N2 - We prove that the number of minimal transversals (and also the number of maximal independent sets) in a 3-uniform hypergraph with n vertices is at most cn, where c ≈ 1.6702. The best known lower bound for this number, due to Tomescu, is adn, where d = 101 / 5 ≈ 1.5849 and a is a constant.
AB - We prove that the number of minimal transversals (and also the number of maximal independent sets) in a 3-uniform hypergraph with n vertices is at most cn, where c ≈ 1.6702. The best known lower bound for this number, due to Tomescu, is adn, where d = 101 / 5 ≈ 1.5849 and a is a constant.
KW - Maximal independent set
KW - Minimal transversal
KW - Uniform hypergraph
UR - https://www.scopus.com/pages/publications/43449089191
UR - https://www.scopus.com/pages/publications/43449089191#tab=citedBy
U2 - 10.1016/j.disc.2007.07.024
DO - 10.1016/j.disc.2007.07.024
M3 - Article
AN - SCOPUS:43449089191
SN - 0012-365X
VL - 308
SP - 3668
EP - 3687
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 16
ER -