Two Questions of Erd?s on Hypergraphs above the Turn Threshold
For ordinary graphs it is known that any graph G with more edges than the Turn number of must contain several copies of , and a copy of , the complete graph on vertices with one missing edge. Erd?s asked if the same result is true for , the complete 3-uniform hypergraph on s vertices. In this note, we show that for small values of n, the number of vertices in G, the answer is negative for . For the second property, that of containing a , we show that for the answer is negative for all large n as well, by proving that the Turn density of is greater than that of .
hypergraphs turan problem