Strong modeling limits of graphs with bounded tree-width

IF 0.9 3区 数学 Q1 MATHEMATICS
European Journal of Combinatorics Pub Date : 2026-04-01 Epub Date: 2026-01-19 DOI:10.1016/j.ejc.2025.104330
Andrzej Grzesik , Daniel Král , Samuel Mohr
{"title":"Strong modeling limits of graphs with bounded tree-width","authors":"Andrzej Grzesik ,&nbsp;Daniel Král ,&nbsp;Samuel Mohr","doi":"10.1016/j.ejc.2025.104330","DOIUrl":null,"url":null,"abstract":"<div><div>The notion of first order convergence of graphs unifies the notions of convergence for sparse and dense graphs. Nešetřil and Ossona de Mendez (2019) proved that every first order convergent sequence of graphs from a nowhere-dense class of graphs has a modeling limit and conjectured the existence of such modeling limits with an additional property, the strong finitary mass transport principle. The existence of modeling limits satisfying the strong finitary mass transport principle was proved for first order convergent sequences of trees by Nešetřil and Ossona de Mendez (2016) and for first order sequences of graphs with bounded path-width by Gajarský et al. (2017). We establish the existence of modeling limits satisfying the strong finitary mass transport principle for first order convergent sequences of graphs with bounded tree-width.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"134 ","pages":"Article 104330"},"PeriodicalIF":0.9000,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669825002239","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/19 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

The notion of first order convergence of graphs unifies the notions of convergence for sparse and dense graphs. Nešetřil and Ossona de Mendez (2019) proved that every first order convergent sequence of graphs from a nowhere-dense class of graphs has a modeling limit and conjectured the existence of such modeling limits with an additional property, the strong finitary mass transport principle. The existence of modeling limits satisfying the strong finitary mass transport principle was proved for first order convergent sequences of trees by Nešetřil and Ossona de Mendez (2016) and for first order sequences of graphs with bounded path-width by Gajarský et al. (2017). We establish the existence of modeling limits satisfying the strong finitary mass transport principle for first order convergent sequences of graphs with bounded tree-width.
有界树宽图的强建模限制
图的一阶收敛性的概念统一了稀疏图和密集图的收敛性的概念。Nešetřil和Ossona de Mendez(2019)证明了来自无密度图类的每一个一阶收敛图序列都有一个建模极限,并通过一个附加性质,即强有限质量输运原理,推测了这种建模极限的存在。Nešetřil和Ossona de Mendez(2016)证明了树的一阶收敛序列满足强有限质量输运原理的建模极限的存在性,Gajarský等人(2017)证明了路径宽度有界的图的一阶序列满足强有限质量输运原理。建立了树宽有界的一阶收敛图序列满足强有限质量输运原理的建模极限的存在性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.10
自引率
10.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍: The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书