Bounding the vertex cover number of a hypergraph
- Cite this article as:
- Ding, GL., Seymour, P. & Winkler, P. Combinatorica (1994) 14: 23. doi:10.1007/BF01305948
For a hypergraphH
, we denote by
τ(H) the minimumk such that some set ofk vertices meets all the edges,
ν(H) the maximumk such that somek edges are pairwise disjoint, and
λ(H) the maximumk≥2 such that the incidence matrix ofH has as a submatrix the transpose of the incidence matrix of the complete graphKk.
We show that τ(H) is bounded above by a function of ν(H) and λ(H), and indeed that if λ(H) is bounded by a constant then τ(H) is at most a polynomial function of ν(H).
AMS subject classification codes (1991)05 C 65 05 C 35
© Akadémiai Kiadó - Springer-Verlag 1994