Abstract:Dallard, Milanič, and Štorgel conjectured that for a hereditary graph class $\mathcal{G}$, if there is some function $f:\mathbb{N}\to\mathbb{N}$ such that every graph $G\in \mathcal{G}$ with clique number $\omega(G)$ has treewidth at most $f(\omega(G))$, then there is a polynomial function $f$ with the same property. Chudnovsky and Trotignon refuted this conjecture in a strong sense, showing that neither polynomial nor any prescribed growth can be guaranteed in general. Here we prove that, in stark contrast, the analog of the Dallard-Milanič-Štorgel conjecture for pathwidth is true: For every hereditary graph class $\mathcal{G}$, if the pathwidth of every graph in $\mathcal{G}$ is bounded by some function of its clique number, then the pathwidth of every graph in $\mathcal{G}$ is bounded by a polynomial function of its clique number.
From: Sepehr Hajebi [view email]
[v1]
Tue, 21 Oct 2025 22:41:13 UTC (66 KB)
[v2]
Thu, 23 Oct 2025 18:45:03 UTC (66 KB)
[v3]
Mon, 14 Sep 2026 14:16:53 UTC (68 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。