图中 K9 ${K}_{9}$ 未成数的局部度条件

IF 0.9 3区 数学 Q2 MATHEMATICS
Takashige Akiyama
{"title":"图中 K9 ${K}_{9}$ 未成数的局部度条件","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":16014,"journal":{"name":"Journal of Graph Theory","volume":"107 1","pages":"70-94"},"PeriodicalIF":0.9000,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"107 1\",\"pages\":\"70-94\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23110\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23110","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

我们证明,如果一个图的每条边至少属于七个三角形,那么就包含一个-小图或包含一个诱导子图。这一结果是阿尔巴和贡萨尔维斯在 2018 年猜想出来的。此外,我们还将这一结果应用于研究图的应力自由性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Local degree conditions for K 9 ${K}_{9}$ -minors in graphs

We prove that if each edge of a graph G $G$ belongs to at least seven triangles, then G $G$ contains a K 9 ${K}_{9}$ -minor or contains K 1 , 2 , 2 , 2 , 2 , 2 ${K}_{1,2,2,2,2,2}$ 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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Graph Theory
Journal of Graph Theory 数学-数学
CiteScore
1.60
自引率
22.20%
发文量
130
审稿时长
6-12 weeks
期刊介绍: The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信