{"title":"Local degree conditions for \n \n \n \n K\n 9\n \n \n ${K}_{9}$\n -minors in graphs","authors":"Takashige Akiyama","doi":"10.1002/jgt.23110","DOIUrl":null,"url":null,"abstract":"<p>We prove that if each edge of a graph <span></span><math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> belongs to at least seven triangles, then <span></span><math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> contains a <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>K</mi>\n \n <mn>9</mn>\n </msub>\n </mrow>\n <annotation> ${K}_{9}$</annotation>\n </semantics></math>-minor or contains <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>K</mi>\n <mrow>\n <mn>1</mn>\n \n <mo>,</mo>\n \n <mn>2</mn>\n \n <mo>,</mo>\n \n <mn>2</mn>\n \n <mo>,</mo>\n \n <mn>2</mn>\n \n <mo>,</mo>\n \n <mn>2</mn>\n \n <mo>,</mo>\n \n <mn>2</mn>\n </mrow>\n </msub>\n </mrow>\n <annotation> ${K}_{1,2,2,2,2,2}$</annotation>\n </semantics></math> as an induced subgraph. This result was conjectured by Albar and Gonçalves in 2018. Moreover, we apply this result to study the stress freeness of graphs.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We prove that if each edge of a graph belongs to at least seven triangles, then contains a -minor or contains as an induced subgraph. This result was conjectured by Albar and Gonçalves in 2018. Moreover, we apply this result to study the stress freeness of graphs.