4 search results - page 1 / 1 » On the number of minimal transversals in 3-uniform hypergrap... |
DM
2008
13 years 11 months ago
2008
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
COMBINATORICA
2007
13 years 11 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
FCT
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
STOC
2002
ACM
14 years 11 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...