Graphs without large triangle free subgraphs (Q1174161)

The authors extend results of \textit{P. Erdős} and \textit{C. A. Rogers} [Can. J. Math. 14, 702--707 (1962; Zbl 0194.25304)]. They show that for \(2\leq r<s\) and large enough \(n\), there exist graphs on \(n\) vertices and clique number less than \(s\) in which every set of vertices, which is not too small, spans a clique on \(r\) vertices. Use is made of the theory of random graphs.