Graphs with few 3-cliques and 3-anticliques are 3-universal

Abstract

For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k=l=3 with a sharp bound. A similar phenomenon is established as well for tournaments with k=l=4.