Prefer a chat interface with context about you and your work?
Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
Abstract For given integers 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 with a sharp bound. A similar phenomenon is established as well for tournaments …