Efficiently distinguishing all tangles in locally finite graphs

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Raphael W. Jacobs, Paul Knappe
{"title":"Efficiently distinguishing all tangles in locally finite graphs","authors":"Raphael W. Jacobs,&nbsp;Paul Knappe","doi":"10.1016/j.jctb.2024.03.004","DOIUrl":null,"url":null,"abstract":"<div><p>While finite graphs have tree-decompositions that efficiently distinguish all their tangles, locally finite graphs with thick ends need not have such tree-decompositions. We show that every locally finite graph without thick ends admits such a tree-decomposition, in fact a canonical one. Our proof exhibits a thick end at any obstruction to the existence of such tree-decompositions and builds on new methods for the analysis of the limit behaviour of strictly increasing sequences of separations.</p></div>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0095895624000224/pdfft?md5=eb127aa3ba243eafd76779abff8b1e9d&pid=1-s2.0-S0095895624000224-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0095895624000224","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

While finite graphs have tree-decompositions that efficiently distinguish all their tangles, locally finite graphs with thick ends need not have such tree-decompositions. We show that every locally finite graph without thick ends admits such a tree-decomposition, in fact a canonical one. Our proof exhibits a thick end at any obstruction to the existence of such tree-decompositions and builds on new methods for the analysis of the limit behaviour of strictly increasing sequences of separations.

有效区分局部有限图中的所有缠结
有限图具有能有效区分其所有纠结的树形分解,而具有粗末端的局部有限图则不需要这样的树形分解。我们证明,每一个没有粗末端的局部有限图都有这样的树形分解,事实上是一个典型的树形分解。我们的证明展示了在任何阻碍这种树形分解存在的障碍处的厚末端,并建立在分析严格递增分离序列的极限行为的新方法之上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: 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.
×
引用
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学术官方微信