Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal. Issue 3 (9th May 2014) - Linial, Nati
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.