文摘
Let s be an integer, f=f(n)f=f(n) a function, and H a graph. Define the Ramsey–Turán number RTs(n,H,f)RTs(n,H,f) as the maximum number of edges in an H-free graph G of order n with αs(G)<fαs(G)<f, where αs(G)αs(G) is the maximum number of vertices in a KsKs-free induced subgraph of G. The Ramsey–Turán number attracted a considerable amount of attention and has been mainly studied for f not too much smaller than n . In this paper we consider RTs(n,Kt,nδ)RTs(n,Kt,nδ) for fixed δ<1δ<1. We show that for an arbitrarily small ε>0ε>0 and 1/2<δ<11/2<δ<1, RTs(n,Ks+1,nδ)=Ω(n1+δ−ε)RTs(n,Ks+1,nδ)=Ω(n1+δ−ε) for all sufficiently large s . This is nearly optimal, since a trivial upper bound yields RTs(n,Ks+1,nδ)=O(n1+δ)RTs(n,Ks+1,nδ)=O(n1+δ). Furthermore, the range of δ is as large as possible. We also consider more general cases and find bounds on RTs(n,Ks+r,nδ)RTs(n,Ks+r,nδ) for fixed r≥2r≥2. Finally, we discuss a phase transition of RTs(n,K2s+1,f)RTs(n,K2s+1,f) extending some recent result of Balogh, Hu and Simonovits.
