Alon–Shapira conjecture for generalized hypergraph Turán numbers

At least 7 years old · documented by

Let fr(n,v,e)f_r(n,v,e) be the maximum number of edges in an nn-vertex rr-uniform hypergraph such that every set of vv vertices spans fewer than ee edges. For fixed integers 2≤k<r2\leq k<r and e≥4e\geq 4, consider fr(n,e(r−k)+k+1,e)f_r(n,e(r-k)+k+1,e). Alon–Shapira conjecture. For any fixed 2≤k<r2\leq k<r and e≥4e\geq 4, we have

nk−o(1)<fr(n,e(r−k)+k+1,e)=o(nk).n^{k-o(1)}<f_r(n,e(r-k)+k+1,e)=o(n^k).

This conjecture extends the asymptotic result of Alon and Shapira for e=3e=3 to all e≥4e\geq 4, predicting the same intermediate growth between nk−o(1)n^{k-o(1)} and o(nk)o(n^k).

References

Primary source

Ping Li, “On F-multicolor Turán number of hypergraph graphs”, arXiv:2502.11869 (2026).

Additional references

2 papers in this index state this conjecture (2018–2025). The statement above is taken from the most recent of them; the others are arXiv:1809.02100.

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.