On the Ramsey-Tur\'an problem for 4-cliques
Combinatorics
2025-03-04 v1
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 -free graphs as a function of the independence number, apart from lower order terms.
Keywords
Cite
@article{arxiv.2503.00644,
title = {On the Ramsey-Tur\'an problem for 4-cliques},
author = {Béla Csaba},
journal= {arXiv preprint arXiv:2503.00644},
year = {2025}
}