The inducibility of oriented stars

IF 1.2 1区数学 Q1 MATHEMATICS

Journal of Combinatorial Theory Series B Pub Date : 2024-05-06 DOI:10.1016/j.jctb.2024.04.001

Ping Hu , Jie Ma , Sergey Norin , Hehui Wu

引用次数: 0

Abstract

We consider the problem of maximizing the number of induced copies of an oriented star $S_{k, ℓ}$ 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.

查看原文本刊更多论文

定向星的可诱导性

我们考虑的问题是在给定大小的数图中最大化定向星 Sk,ℓ 的诱导副本数，其中星的中心有外度 k 和内度 ℓ。Huang 在 [11] 中解决了 kℓ=0 的情况。在此，我们对至少有七个顶点的所有其他定向星进行渐近求解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Theory Series B 数学-数学

CiteScore

2.70

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.