加载中…
The extension of an -uniform hypergraph is obtained from it by adding for every pair of vertices of , which is not covered by an edge in , an extra edge containing this pair and new vertices. In this paper we determine the Tur'an number of the extension of an -graph consisting of two vertex-disjoint edges, settling a conjecture of Hefetz and Keevash, who previously determined this Tur'an number for . As the key ingredient of the proof we show that the Lagrangian of intersecting -graphs is maximized by principally intersecting -graphs for .

生成讲解博客的中文版本

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