The inducibility of 6-vertex graphs

Abstract

The inducibility constant $λ_{F}$ of a graph $F$ is the asymptotically maximum induced density of $F$ in a growing sequence of graphs. This paper systematically investigates the case when $F$ has 6 vertices (and there are 78 cases to consider up to isomorphism and complementation). We show that flag algebras can compute the sharp upper bound on $λ_F$ in 36 cases of which, as far as the authors know, 30 are new results. In each of the solved cases, we also prove results about the structure of large (almost) extremal graphs. In particular, we establish perfect stability in all 32 cases when the extremal construction has no quasirandom parts. We also present conjectures about the value of $λ_{F}$ for 10 further cases (where the upper and lower bounds are very close to each other).