Inducibility of rainbow graphs

Emily Cairncross, Clayton Mizgerd, Dhruv Mubayi

Fix $k\ge 11$ and a rainbow $k$-clique $R$. We prove that the inducibility of $R$ is $k!/(k^k-k)$. An extremal construction is a balanced recursive blow-up of $R$. This answers a q…