Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2308.05817

Comparing Width Parameters on Graph Classes

Nick Brettell·Andrea Munaro·Daniël Paulusma·Shizhou Yang
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study how the relationship between non-equivalent width parameters changes once we restrict to some special graph class. As width parameters, we consider treewidth, clique-width, twin-width, mim-width, sim-width and tree-independence number, whereas as graph classes we consider $K_{t,t}$-subgraph-free graphs, line graphs and their common superclass, for $t \geq 3$, of $K_{t,t}$-free graphs. We first provide a complete comparison when restricted to $K_{t,t}$-subgraph-free graphs, showing in particular that treewidth, clique-width, mim-width, sim-width and tree-independence number are all equivalent. This extends a result of Gurski and Wanke (2000) stating that treewidth and clique-width are equivalent for the class of $K_{t,t}$-subgraph-free graphs. Next, we provide a complete comparison when restricted to line graphs, showing in particular that, on any class of line graphs, clique-width, mim-width, sim-width and tree-independence number are all equivalent, and bounded if and only if the class of root graphs has bounded treewidth. This extends a result of Gurski and Wanke (2007) stating that a class of graphs ${\cal G}$ has bounded treewidth if and only if the class of line graphs of graphs in ${\cal G}$ has bounded clique-width. We then provide an almost-complete comparison for $K_{t,t}$-free graphs, leaving one missing case. Our main result is that $K_{t,t}$-free graphs of bounded mim-width have bounded tree-independence number. This result has structural and algorithmic consequences. In particular, it proves a special case of a conjecture of Dallard, Milanič and Štorgel. Finally, we consider the question of whether boundedness of a certain width parameter is preserved under graph powers. We show that the question has a positive answer for sim-width precisely in the case of odd powers.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang. 2025-04-21. Comparing Width Parameters on Graph Classes. https://arxiv.org/abs/2308.05817

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗