Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648760 | Discrete Mathematics | 2008 | 20 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zbigniew Lonc, MirosÅaw TruszczyÅski,