On the Ramsey-Tur\'an problem for 4-cliques

We present an essentially tight bound for the Ramsey-Tur\'an problem for 4-cliques without using the Regularity lemma. This enables us to substantially extend the range in which one has the tight bound for the number of edges in K₄-free graphs as a function of the independence number, apart from lower order terms.