A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Transversal numbers of uniform hypergraphs
1990
Graphs and Combinatorics
The transversal number ~(H) of a hypergraph H is the minimum eardinality of a set of vertices that intersects all edges of H. For k ~ 1 define ck = supz(H)/(ra + 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 ) )~, r. This settles a problem of Tuza. t~
doi:10.1007/bf01787474
fatcat:i5u57aacgzcefe3qas57bef7xi