Treewidth and Separation Number: An Optimal Linear Bound

The \emph{separation number} $\sn(G)$ of a graph $G$ is the smallest integer $a$ such that every subgraph $H$ of $G$ admits a separation $(A,B)$ of {\em order} $|A\cap B|\le a$ whose two sides $A\setminus B$ and $B\setminus A$ each contain at most $2|V(H)|/3$ vertices. Dvořák and Norin proved that $\tw(G)\le 15\sn(G)$ for every nonempty graph $G$. We improve the constant to its optimal value: every nonempty graph satisfies $\tw(G)\le 4\sn(G)-2$. This is best possible: for every $k\ge 2$, there is a graph $G_k$ with $\tw(G_k)=4k+2$ and $\sn(G_k)=k+1$.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20777
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Treewidth and Separation Number: An Optimal Linear Bound

Rong Chen
arXiv (Cornell University)
Advanced Graph Theory Research
preprint

Treewidth and Separation Number: An Optimal Linear Bound

Rong Chen
preprint en

Abstract

The \emph{separation number} $\sn(G)$ of a graph $G$ is the smallest integer $a$ such that every subgraph $H$ of $G$ admits a separation $(A,B)$ of {\em order} $|A\cap B|\le a$ whose two sides $A\setminus B$ and $B\setminus A$ each contain at most $2|V(H)|/3$ vertices. Dvořák and Norin proved that $\tw(G)\le 15\sn(G)$ for every nonempty graph $G$. We improve the constant to its optimal value: every nonempty graph satisfies $\tw(G)\le 4\sn(G)-2$. This is best possible: for every $k\ge 2$, there is a graph $G_k$ with $\tw(G_k)=4k+2$ and $\sn(G_k)=k+1$.

arXiv (Cornell University)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon