Erdős Problem #1157 — Extremal Number of Uniform Hypergraphs
For integers , let be the family of all -uniform hypergraphs with vertices and edges. Determine the extremal number for every ; equivalently, determine a function such that
for all and all .
Progress summary
Never refreshed
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.