Erdős Problem #500 — What is ?
For an integer , let a -uniform hypergraph on an -element vertex set have an edge set . A copy of is a four-element set for which all four triples are edges. The question is to determine, for each , the Turán number
In particular, for . This is a non-induced forbidden-subhypergraph problem: it excludes four vertices carrying all four triples, without imposing conditions on the other triples among those vertices. Erdős Problems #500 Keevash, Hypergraph Turán Problems
Background
This is the tetrahedron case of the hypergraph Turán problem: for a fixed forbidden uniform hypergraph, maximize the number of edges while avoiding a copy of it. Turán posed the complete-uniform-hypergraph problem in 1941. The contrast with ordinary graph theory is striking: Turán’s theorem determines the extremal numbers for complete graphs, while even the asymptotic density for the 3-uniform tetrahedron problem remains undetermined in the cited accounts. Erdős offered prizes for solutions to particular cases and for a general solution. Keevash, Hypergraph Turán Problems
Turán’s proposed construction partitions the vertices into three nearly equal classes , with indices taken cyclically. It includes triples meeting all three classes and triples with two vertices in and one in . This construction motivates the conjectured asymptotic density . The normalized extremal numbers have a limit, the Turán density
so determining this density would give the leading asymptotic term, though not by itself all finite values of . Erdős Problems #500 Keevash, Hypergraph Turán Problems
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.