A new lower bound for a Ramsey-type problem (Q2568501)

Let \(3 \leq r < s\) be fixed integers. Let \(G\) be a \(K_s\)-free graph on \(n\) vertices and denote \(f_r(G)\) the maximum cardinality of a subset of \(V(G)\) that contains no copy of \(K_r.\) Furthermore let \(f_{r,s}=\min f_r(G)\) where the minimum is taken on all \(K_s\)-free graphs on \(n\) vertices. This nice short paper draws new lower bounds on this quantity, improving substantially previously known results.