The semi-inducibility problem

Abdul Basit, Bertille Granet, Daniel Horsley +2

Let $H$ be a $k$-edge-coloured graph and let $n$ be a positive integer. What is the maximum number of copies of $H$ in a $k$-edge-coloured complete graph on $n$ vertices? This pape…