Key points are not available for this paper at this time.
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 Kₒ, ₓ, for t= Cˢ, with (n^2-1/s) edges matching the upper bound of Kovari, Sos and Turan.
Boris Bukh (Wed,) studied this question.