The Turán problem for hypergraphs on fixed size (Q2571304)

For the hypergraph \(F\) denote ex\((n,F)\) the maximum number of edges in an \(r\)-uniform hypergraph with \(n\) vertices that does not contain a copy of \(F.\) It is well known that the so-called Turán density \(\pi(F) = \lim_{n \rightarrow \infty} \text{ex}(n,F) / {n \choose r}\) always exists. However there are very few hypergraphs (with \(r>2\)) with known Turán density, and even fewer known about exact Turán numbers. This note proves a general upper bound on the Turán density: Let \(F\) be an \(r\)-uniform hypergraph with \(f\) edges. Then \(\pi(F)\leq {1 \over 2} [ (f^2 -2f -3)^{1/2}-f-3)]\) if \(r=3\) and \(f\geq 4\). For a fixed \(r\geq 3\) and \(f\rightarrow \infty\) we have \(\pi(F)< {f-2\over f-1}- (1+o(1))(2r!^{2/r}f^{3-2/r}) ^{-1}.\)