On the Ramsey-Turán problem for 4-cliques
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912255286706176 |
|---|---|
| author | Csaba, Béla |
| author_facet | Csaba, Béla |
| contents | We present an essentially tight bound for the Ramsey-Turán 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_4$-free graphs as a function of the independence number, apart from lower order terms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_00644 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Ramsey-Turán problem for 4-cliques Csaba, Béla Combinatorics We present an essentially tight bound for the Ramsey-Turán 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_4$-free graphs as a function of the independence number, apart from lower order terms. |
| title | On the Ramsey-Turán problem for 4-cliques |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2503.00644 |