A hypergraph extension of Turán's theorem (Q2581504): Difference between revisions

This paper contains several theorems on Turán-type extremal questions for \(r\)-uniform hypergraphs. The main result is that the author determines the Turán density of the \(r\)-uniform hypergraph that results from the complete graph \(K_l\) by adding to each edge \(r-2\) new vertices, with these new vertices all distinct, so the \(r\)-uniform hypergraph has \((r-2){l\choose2} + l\) vertices and \({l\choose 2}\) hyperedges. It is shown that the maximum number of edges in an \(r\)-uniform hypergraph without this subhypergraph is \({(l-1)_r\over(l-1)^r}{n\choose r} + o(n^r)\). The author shows also a stability version of this result similar to Simonovits stability theorem: A hypergraph which does not contain this subgraph, and is within \(\varepsilon n^r\) edges of that maximum edge number, can be converted to the extremal graph by changing \(\delta(\varepsilon)n^r\) edges.