, Volume 14, Issue 1, pp 23-34

Bounding the vertex cover number of a hypergraph

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

For a hypergraphH, we denote by

  1. τ(H) the minimumk such that some set ofk vertices meets all the edges,

  2. ν(H) the maximumk such that somek edges are pairwise disjoint, and

  3. λ(H) the maximumk≥2 such that the incidence matrix ofH has as a submatrix the transpose of the incidence matrix of the complete graphK k .

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).