← All problems

Erdős Problem #1158 — Partite Hypergraph Extremal Lower Bound

1 year old · traced to

For all integers t,r≥2t,r\geq2, let Kt(r)K_t(r) be the complete tt-partite tt-uniform hypergraph with rr vertices in each part. Is it true that, for every real ε>0\varepsilon>0, all sufficiently large nn satisfy

n t−r1−t−ε≤ex⁡t(n,Kt(r))?n^{\,t-r^{1-t}-\varepsilon} \leq \operatorname{ex}_t(n,K_t(r))?
References

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.