Generalized Ramsey–Turán density for cliques
We study the generalized Ramsey–Turán function $\mathrm {RT}(n,K_s,K_t,o(n))$ , which is the maximum possible number of copies of $K_s$ in an n-vertex $K_t$ -free graph with independence number $o(n)$ . The case when $s=2$ was settled by Erdős, Sós, Bollobás, Hajnal,...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press
2025-01-01
|
| Series: | Forum of Mathematics, Sigma |
| Subjects: | |
| Online Access: | https://www.cambridge.org/core/product/identifier/S2050509425000295/type/journal_article |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|