{"title":"On generalized Turán number of graphs with bounded matching number","authors":"Yisai Xue , Liying Kang","doi":"10.1016/j.dam.2025.08.029","DOIUrl":null,"url":null,"abstract":"<div><div>The generalized Turán number <span><math><mrow><mi>ex</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>H</mi><mo>,</mo><mi>F</mi><mo>)</mo></mrow></mrow></math></span> is defined as the maximum number of copies of a graph <span><math><mi>H</mi></math></span> in an <span><math><mi>n</mi></math></span>-vertex graph that does not contain any graph <span><math><mrow><mi>F</mi><mo>∈</mo><mi>F</mi></mrow></math></span>. Alon and Frankl initiated the study of Turán problems with a bounded matching number. In this paper, we establish stability results for generalized Turán problems with bounded matching number. Using the stability results, we provide exact values of <span><math><mrow><mi>ex</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>,</mo><mrow><mo>{</mo><mi>F</mi><mo>,</mo><msub><mrow><mi>M</mi></mrow><mrow><mi>s</mi><mo>+</mo><mn>1</mn></mrow></msub><mo>}</mo></mrow><mo>)</mo></mrow></mrow></math></span> for <span><math><mi>F</mi></math></span> being any non-bipartite graph or a path.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"377 ","pages":"Pages 586-597"},"PeriodicalIF":1.0000,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25004706","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
The generalized Turán number is defined as the maximum number of copies of a graph in an -vertex graph that does not contain any graph . Alon and Frankl initiated the study of Turán problems with a bounded matching number. In this paper, we establish stability results for generalized Turán problems with bounded matching number. Using the stability results, we provide exact values of for being any non-bipartite graph or a path.
期刊介绍:
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.