Inducibility of the Net Graph

Adam Blumenthal, Michael Phillips

A graph $F$ is called a fractalizer if for all $n$ the only graphs which maximize the number of induced copies of $F$ on $n$ vertices are the balanced iterated blow ups of $F$. Whi…