Turán Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs

Erica L. L. Liu, Jian Wang

For two $s$-uniform hypergraphs $H$ and $F$, the Turán number $e{x}_s(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Let $s,r,k,n_1,\dots ,n_r$ be integers…