Erdős Problem #1158 — Partite Hypergraph Extremal Lower Bound
For all integers , let be the complete -partite -uniform hypergraph with vertices in each part. Is it true that, for every real , all sufficiently large satisfy
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.