Hypergraph Turan numbers of vertex disjoint cycles

In this paper, we employ standard definitions and notation from hypergraph the-ory (see e.g.,[1]). A hypergraph is a pair H= (V,E) consisting of a set V of verticesand a set E⊆ P(V) of edges. If every edge contains exactly kvertices, then H is ak-uniform hypergraph. For two hypergraphs Gand H, we write G⊆ H if there is aninjective homomorphism from Ginto H. We use G∪H to denote the disjoint union