Inducibility in $H$-free graphs and inducibility of Tur\'an graphs

TL;DR

This paper investigates the inducibility of graphs within $H$-free graphs, providing new results on the values attained by inducibility, especially for Turán graphs, and characterizing when inducibility is achieved by specific graphons.

Contribution

It establishes when inducibility attains infinitely many values, characterizes inducibility for Turán and complete partite graphs, and identifies conditions for inducibility to be achieved by distinct part sizes.

Findings

Inducibility of most graphs varies infinitely with $k$.

For Turán graphs, inducibility is determined for all on up to 14 vertices.

Inducibility of graphs with at most one singleton part is attained by a finite set of graphons.

Abstract

For graphs $F$ and $H$, let $i(F)$ denote the inducibility of $F$ and let $i_H(F)$ denote the inducibility of $F$ over $H$-free graphs. We prove that for almost all graphs $F$ on a given number of vertices, $i_{K_k}(F)$ attains infinitely many values as $k$ varies. For complete partite graphs $F$ (and, more generally, for symmetrizable families of graphs $F$), we prove that $i_H(F)=i_{K_k}(F)$ where $k=\chi(H)$, and is attained by a complete $\ell$-partite graphon $W_{F,k}$, where $\ell < k$. We determine the part sizes of $W_{F,k}$ for all $k$, whence determine $i(F)$, whenever $F$ is the Tur\'an graph on $s$ vertices and $r$ parts, for all $s \le 3r+1$, which was recently proved by Liu, Mubayi, and Reiher for $s=r+1$. As a corollary, this determines the inducibility of all Tur\'an graphs on at most $14$ vertices. Furthermore, since inducibility is invariant under complement, this determines the inducibility of all matchings and, more generally, all graphs with maximum degree $1$, of any size. Similarly, this determines the inducibility of all triangle factors, of any size. For complete partite graphs $F$ with at most one singleton part, we prove that $i_{K_k}(F)$ only attains finitely many values as $k$ varies; in particular, there exists $t=t(F)$ such that $i(F)$ is attained by some complete $t$-partite graphon. This is best possible as it was shown by Liu, Pikhurko, Sharifzadeh, and Staden that this is not necessarily true if there are two singleton parts. Finally, for every $r$, we give a nontrivial sufficient condition for a complete $r$-partite graph $F$ to have the property that $i(F)$ is attained by a complete partite graphon all whose part sizes are distinct.