← All problems

Generalized Turán number exponent conjecture

Less than 1 year old · traced to

Let s,a,b,ts,a,b,t be integers satisfying s<a≤bs<a\leq b. For graphs Ka,bK_{a,b} and Ks,tK_{s,t}, write ex(n,Ka,b,Ks,t)\mathrm{ex}(n,K_{a,b},K_{s,t}) for the maximum number of copies of Ka,bK_{a,b} in an nn-vertex Ks,tK_{s,t}-free graph.

Generalized Turán number exponent conjecture. There exists t0t_0 such that, for all t≥t0t\geq t_0,

ex(n,Ka,b,Ks,t)=Θs,t,a,b(ns).\mathrm{ex}(n,K_{a,b},K_{s,t})=\Theta_{s,t,a,b}(n^s).

The preceding theorem proves this assertion for s∈{2,3}s\in\{2,3\} when tt is sufficiently large. The conjecture extends that result to all s<a≤bs<a\leq b, and the source gives no resolution in the general case.

References

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

Source: Oliver Janzer, Sean Longbrake and Liana Yepremyan, “On the generalized Turán number of complete bipartite graphs”, arXiv:2606.09801 (2026).

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.