The inducibility of oriented stars

Journal of Combinatorial Theory, Series B(2024)

引用 0|浏览2
暂无评分
摘要
We consider the problem of maximizing the number of induced copies of an oriented star Sk,ℓ in digraphs of given size, where the center of the star has out-degree k and in-degree ℓ. The case kℓ=0 was solved by Huang in [11]. Here, we asymptotically solve it for all other oriented stars with at least seven vertices.
更多
查看译文
关键词
Digraphs,Induced subgraphs,Inducibility
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要