跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22552 · v1

On (Pathwidth, Clique)-boundedness

首次提交 2026-11-17 18:42
版本更新 2026-11-17 18:42
雷达观测 2026-11-18 11:33
arXiv ↗PDF ↗

摘要

We prove that every $(\pw,ω)$-bounded class of graphs has bounded tree-independence number, answering a question of Bešter Štorgel, Dallard, Lozin, Milanič, and Zamaraev. We deduce this from a bound on the tree-independence number of graphs with neither $\B_ρ$ nor Kσ,σK_{σ,σ} as an induced minor, where $\B_ρ$ is the complete binary tree of height ρρ and the bound depends only on ρρ and σσ. We then obtain an asymptotically sharp bound on the path-independence number of nn-vertex graphs in any $(\pw,ω)$-bounded class. The lower-bound examples also give counterexamples to a conjecture of Hickingbotham and Joret. We further prove that, for every forest FF and every ℓ∈N\ell\in\N, there is a constant k=k(F,ℓ)∈Nk=k(F,\ell)\in\N such that every graph GG with no induced theta or ℓ\ell-long prism and no induced subgraph isomorphic to FF satisfies tree-independence number at most kk. This proves a strengthened form of a conjecture of Chudnovsky, Hajebi, and Trotignon. Finally, for every integer s≥2s\ge2, we characterize the forests FF for which excluding FF as an induced minor and Ks,sK_{s,s} as an induced subgraph bounds tree-independence number. This extends the characterization of Bonnet, Duhamel, and Hickingbotham, who considered bounded pathwidth with Ks,sK_{s,s} excluded as a subgraph.

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

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

观测到的版本

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

v1 · 2026-11-17 18:42 · 最新观测版本

On (Pathwidth, Clique)-boundedness

We prove that every $(\pw,ω)$-bounded class of graphs has bounded tree-independence number, answering a question of Bešter Štorgel, Dallard, Lozin, Milanič, and Zamaraev. We deduce this from a bound on the tree-independence number of graphs with neither $\B_ρ$ nor Kσ,σK_{σ,σ} as an induced minor, where $\B_ρ$ is the complete binary tree of height ρρ and the bound depends only on ρρ and σσ. We then obtain an asymptotically sharp bound on the path-independence number of nn-vertex graphs in any $(\pw,ω)$-bounded class. The lower-bound examples also give counterexamples to a conjecture of Hickingbotham and Joret. We further prove that, for every forest FF and every ℓ∈N\ell\in\N, there is a constant k=k(F,ℓ)∈Nk=k(F,\ell)\in\N such that every graph GG with no induced theta or ℓ\ell-long prism and no induced subgraph isomorphic to FF satisfies tree-independence number at most kk. This proves a strengthened form of a conjecture of Chudnovsky, Hajebi, and Trotignon. Finally, for every integer s≥2s\ge2, we characterize the forests FF for which excluding FF as an induced minor and Ks,sK_{s,s} as an induced subgraph bounds tree-independence number. This extends the characterization of Bonnet, Duhamel, and Hickingbotham, who considered bounded pathwidth with Ks,sK_{s,s} excluded as a subgraph.

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