On the Ramsey-Tur\'an problem for 4-cliques
Abstract
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 K4-free graphs as a function of the independence number, apart from lower order terms.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.