Richard Ueltzen

Characterizing graphs with high inducibility

For a positive integer $k$ and a graph $H$ on $k$ vertices, we are interested in the inducibility of $H$, denoted $\mathrm{ind}(H)$, which is defined as the maximum possible probability that choosing $k$ vertices uniformly at random from a large graph $G$, they induce a copy of $...