Erdős Problem #837 — Density-increment thresholds for 3-uniform hypergraphs
For a finite -uniform hypergraph , let denote its number of vertices and its number of edges. For , the question defines using the following density-increment property: an \alpha\in[[0](#reference-0),[1](#reference-1)] belongs to if there is a number such that, for every sequence of -uniform hypergraphs satisfying
there are subgraphs for which and
The definition also requires that this property need not hold when the premise is replaced by . The question is to determine . Erdős Problems #837
Background
This is a problem of Erdős and Simonovits, cited to their 1974 item “Unsolved Problems.” It asks for thresholds at which a uniform positive excess in the density of large hypergraphs forces arbitrarily large subgraphs with density bounded away above the threshold. Erdős Problems #837 Erdős, “Unsolved Problems” (1974)
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.