{"title":"定向星的可诱导性","authors":"Ping Hu , Jie Ma , Sergey Norin , Hehui Wu","doi":"10.1016/j.jctb.2024.04.001","DOIUrl":null,"url":null,"abstract":"<div><p>We consider the problem of maximizing the number of induced copies of an oriented star <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>k</mi><mo>,</mo><mi>ℓ</mi></mrow></msub></math></span> in digraphs of given size, where the center of the star has out-degree <em>k</em> and in-degree <em>ℓ</em>. The case <span><math><mi>k</mi><mi>ℓ</mi><mo>=</mo><mn>0</mn></math></span> was solved by Huang in <span>[11]</span>. Here, we asymptotically solve it for all other oriented stars with at least seven vertices.</p></div>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The inducibility of oriented stars\",\"authors\":\"Ping Hu , Jie Ma , Sergey Norin , Hehui Wu\",\"doi\":\"10.1016/j.jctb.2024.04.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We consider the problem of maximizing the number of induced copies of an oriented star <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>k</mi><mo>,</mo><mi>ℓ</mi></mrow></msub></math></span> in digraphs of given size, where the center of the star has out-degree <em>k</em> and in-degree <em>ℓ</em>. The case <span><math><mi>k</mi><mi>ℓ</mi><mo>=</mo><mn>0</mn></math></span> was solved by Huang in <span>[11]</span>. Here, we asymptotically solve it for all other oriented stars with at least seven vertices.</p></div>\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2024-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0095895624000285\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0095895624000285","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
We consider the problem of maximizing the number of induced copies of an oriented star in digraphs of given size, where the center of the star has out-degree k and in-degree ℓ. The case was solved by Huang in [11]. Here, we asymptotically solve it for all other oriented stars with at least seven vertices.
期刊介绍：
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
