Transversal numbers of uniform hypergraphs

Research output: Contribution to journalArticlepeer-review

126 Scopus citations


The transversal number τ(H) of a hypergraph H is the minimum cardinality of a set of vertices that intersects all edges of H. For k ≥ 1 define ck =sup τ(H)/(m + n), where H ranges over all k-uniform hypergraphs with n vertices and m edges. Applying probabilistic arguments we show that ck = (1 +o(1))logek/k. This settles a problem of Tuza.

Original languageEnglish (US)
Pages (from-to)1-4
Number of pages4
JournalGraphs and Combinatorics
Issue number1
StatePublished - Mar 1990
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Transversal numbers of uniform hypergraphs'. Together they form a unique fingerprint.

Cite this