Feng-Chu Lai

Learn More
All standard terminology of hypergraphs is from [ 11. Suppose H = (V, E) is a k-uniform hypergraph with n vertices and m edges. Tuza [2] proposed the problem of finding an upper bound for the transversal number r(H), of the form t(H) < ck(n + m), where ck depends only on k. More precisely, we want to determine ck z sup z(H)/(m + n), where H runs over all(More)
  • 1