The inducibility of oriented stars

Abstract

We consider the problem of maximizing the number of induced copies of an oriented star $S_{k,\ell }$ in digraphs of given size, where the center of the star has out-degree $k$ and in-degree $\ell$. The case $k\ell =0$ was solved by Huang. Here, we asymptotically solve it for all other oriented stars with at least seven vertices.

References in corpus (5)

• Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle
• A bound on the inducibility of cycles
• A Summary of Problems and Results related to the Caccetta-Haggkvist Conjecture
• Inducibility of directed paths
• On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices

Cited by in corpus (2)

• Inducibility of the Net Graph
• Inducibility of 4-vertex tournaments