Turán bound for suspensions of arbitrary trees

About 1 year old · traced to

Let TT be a tree whose smaller color class has size kk, and let T^\widehat{T} denote the suspension of TT. Let f(n,k)f(n,k) be the bound defined earlier in the paper. Conjecture on suspensions of trees. For large nn,

ex(n,T^)≤f(n,k).{\rm ex}(n,\widehat{T})\le f(n,k).

The paper proves the result for balanced trees and notes that the same conclusion would follow for certain unbalanced trees if the relevant decomposition lemma holds. The conjecture asks whether the bound extends to every tree, and the source gives no resolution.

References

Primary source

Xiutao Zhu, Xiaolin Wang, Yanbo Zhang and Fangfang Zhang, “Turán problems for suspension of a balanced tree”, arXiv:2503.05166 (2025).

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.