Integer and fractional packings of hypergraphs

Let F0 be a fixed k-uniform hypergraph. The problem of finding the integer F0-packing number νF0(H) of a k-uniform hypergraph H is an NP-hard problem. Finding the fractional F0-packing number however can be done in polynomial time. In this paper we give a lower bound for the integer F0-packing number νF0(H) in terms of and show that .