The inducibility of oriented stars

Abstract: We consider the problem of maximizing the number of induced copies of an oriented star

S_{k, e l l}

in digraphs of given size, where the center of the star has out-degree

k

and in-degree

e l l

. The case

k e l l = 0

was solved by Huang. Here, we asymptotically solve it for all other oriented stars with at least seven vertices.

This page was built for publication: The inducibility of oriented stars