Ramsey-Turán problems with small independence numbers
From MaRDI portal
Publication:6201873
Abstract: Given a graph and a function , the Ramsey-Tur'an number is the maximum number of edges in an -vertex -free graph with independence number at most . For being a small clique, many results about are known and we focus our attention on for . By applying Szemer'edi's Regularity Lemma, the dependent random choice method and some weighted Tur'an-type results, we prove that these cliques have the so-called phase transitions when is around the inverse function of the off-diagonal Ramsey number of versus a large clique for some .
Recommendations
Cites work
- scientific article; zbMATH DE number 1260956 (Why is no real title available?)
- scientific article; zbMATH DE number 3435529 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- scientific article; zbMATH DE number 3333194 (Why is no real title available?)
- A few remarks on Ramsey--Turán-type problems
- A note on Ramsey numbers
- A note on the independence number of triangle-free graphs
- Dynamic concentration of the triangle‐free process
- Localized versions of extremal problems
- More results on Ramsey-Turán type problems
- On a Ramsey-Turán type problem
- Phase transitions in Ramsey-Turán theory
- The Ramsey-Turán problem for cliques
- The asymptotics of \(r(4,t)\)
- The early evolution of the \(H\)-free process
- The triangle-free process and the Ramsey number \(R(3,k)\)
- Turán-Ramsey Theorems and Kp-Independence Numbers
- Two Conjectures in Ramsey--Turán Theory
Cited in
(3)
This page was built for publication: Ramsey-Turán problems with small independence numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201873)