Let be the -graph on vertices with parts and , where the edges consist of all -tuples with vertex in and vertices in , and the sizes of and are chosen to maximise the number of edges. Let be the -graph with pairwise disjoint edges. Given an -graph and a positive integer , we define the {\em extension} of , denoted by as follows: Label the vertices of as . Add new vertices . For each pair of vertices not contained in an edge of , we add a set of new vertices and the edge ${v_i,v_j} \cup B_{ij}B_{ij}{i,j}$. Hefetz and Keevash conjectured that the Tur'an number of the extension of is for $r \ge 4nnGH_{2r}^{M_2^r}rn{1 \over r}n\cdot{{r-1\over r}n \choose r-1}GS^r(n)$. In this paper, we confirm the above conjecture for .

生成讲解博客的中文版本

生成AI智能校验的中文版本