An upper bound for the Turán number \(t_3(n,4)\) (Q1304632): Difference between revisions

It is proved that the smallest number \(t_3(n,4)\) such that every 3-uniform hypergraph on \(n\) vertices with more than \(t_3(n,4)\) edges necessarily contains a complete subgraph with 4 vertices, satisfies the following upper bound: \[ \lim_{n\to\infty} {t_3(n, 4)\over{n\choose 3}}\leq {3+\sqrt{17}\over 12}. \]