The Turan problem asks for the largest number of edges in an n-vertex graph not containing a fixed forbidden subgraph F. We construct a new family of graphs not containing Ks,t, for t= Cˢ, with Ω(n2-1/s) edges matching the upper bound of Kovari, Sos and Turan.
No takes yet. Share an insight, caveat, or question.
Boris Bukh (2024) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: