跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.24544 · v1

Treewidth 3 in the Product Structure Theorem for Bounded Degree Graphs in Minor-Closed Classes

首次提交 2026-11-18 22:50
版本更新 2026-11-18 22:50
雷达观测 2026-11-19 15:04
arXiv ↗PDF ↗

摘要

We show that, for all positive integers tt and ΔΔ, there exists an integer cc such that, for every KtK_t-minor-free graph GG with maximum degree at most ΔΔ, there exists a graph HH of treewidth at most 33 and a path PP such that GG is isomorphic to a subgraph of the strong product H⊠P⊠KcH\boxtimes P\boxtimes K_c. This improves on a previous result of Dujumović, Esperet, Micek, Walczak, and Wood (2022) by bounding the treewidth of HH independently of tt and ΔΔ. As an immediate consequence we obtain a bound of O(r4)O(r^4) on the rr-weak colouring number of bounded-degree graphs from any proper minor-closed graph class.

作者备注:28 pages, 4 figures, written by humans

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 22:50 · 最新观测版本

Treewidth 3 in the Product Structure Theorem for Bounded Degree Graphs in Minor-Closed Classes

We show that, for all positive integers tt and ΔΔ, there exists an integer cc such that, for every KtK_t-minor-free graph GG with maximum degree at most ΔΔ, there exists a graph HH of treewidth at most 33 and a path PP such that GG is isomorphic to a subgraph of the strong product H⊠P⊠KcH\boxtimes P\boxtimes K_c. This improves on a previous result of Dujumović, Esperet, Micek, Walczak, and Wood (2022) by bounding the treewidth of HH independently of tt and ΔΔ. As an immediate consequence we obtain a bound of O(r4)O(r^4) on the rr-weak colouring number of bounded-degree graphs from any proper minor-closed graph class.

查看此版本解读 →查看此版本原文 ↗