← All problems

Erdős Problem #1157 — Extremal Number of Uniform Hypergraphs

1 year old · traced to

For integers s,k,r≥2s,k,r\geq2, let F\mathcal F be the family of all rr-uniform hypergraphs with kk vertices and ss edges. Determine the extremal number ex⁡r(n,F)\operatorname{ex}_r(n,\mathcal F) for every n∈Nn\in\mathbb N; equivalently, determine a function A(n,r,k,s)A(n,r,k,s) such that

ex⁡r(n,F)=A(n,r,k,s)\operatorname{ex}_r(n,\mathcal F)=A(n,r,k,s)

for all n∈Nn\in\mathbb N and all r,k,s≥2r,k,s\geq2.

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.