Stable Graphs of Twin-width 2

• The paper establishes that every Hₜ-semi-free graph with twin-width 2 has rank-width at most 22t+170, resolving a central conjecture.
• It employs a detailed contraction sequence analysis and innovative lemmas to link red 4-paths with the forbidden half-graph structure.
• These insights yield practical algorithmic benefits, particularly for graph isomorphism testing via fixed-dimension Weisfeiler–Leman procedures.

Stable graphs of twin-width 2 are a significant subclass in the intersection of structural graph theory and descriptive complexity, characterized by powerful structural restrictions and algorithmic consequences. Their study resolves a central conjecture relating model-theoretic stability, the combinatorial parameter of twin-width, and the graph invariant rank-width, with immediate implications for logical definability and graph isomorphism testing.

1. Fundamental Definitions

A trigraph is a combinatorial structure in which every pair $\{u, v\}$ of vertices is either connected by a black edge, a red edge, or is non-adjacent. The red-degree $\mathrm{rdeg}_G(v)$ of a vertex $v$ in a trigraph $G$ is the number of red edges incident to $v$. A contraction step merges two parts $P,Q$ of the partitioned vertex set; all non-homogeneous adjacency pairs become red, homogeneous blacks remain black, and non-adjacent pairs remain non-adjacent. The full contraction sequence for a graph $G$ is a sequence of trigraphs indexed by coarsenings of the vertex partition, each obtained by a contraction, starting from the discrete partition.

The width of a contraction sequence is defined as the maximal red-degree occurring in any intermediate trigraph of the sequence. The twin-width $\mathrm{tww}(G)$ is the minimal $k$ such that $G$ admits a contraction sequence of width at most $k$.

Stability is defined through the exclusion of half-graphs. For $t\in\mathbb{N}$, the half-graph $H_t$ consists of a bipartition $\{v_1,\dots,v_t\} \cup \{w_1,\dots,w_t\}$ with edges $v_iw_j$ if and only if $i \leq j$. A graph is $H_t$-semi-free if it has no semi-induced copy of $H_t$, that is, for any bijection $\iota$ of $V(H_t)$ into $V(G)$, the adjacency between the two bipartition classes is not precisely that of $H_t$. A class $\mathcal{C}$ is stable (monadically stable) if $\mathcal{C}$ is contained in the set of $H_t$-semi-free graphs for some $t$.

Rank-width $\mathrm{rw}(G)$ of a (simple) graph $G$ is defined via subcubic rank-decompositions of $G$: trees whose leaves are bijectively labeled by $V(G)$, with each edge $e$ of the tree corresponding to some bipartition $(A_e, B_e)$ of $V(G)$. The width is the largest rank of the binary adjacency matrix $\mathrm{Adj}_G(A_e,B_e)$ (over $\mathbb{F}_2$) across all $e$. The rank-connectivity is $$\kappa^\mathrm{rk}_G(X,Y) = \min_{X \subseteq Z \subseteq V(G) \setminus Y} \mathrm{rk}_G(Z, V(G) \setminus Z)$$. The well-linked-set theorem of Oum–Seymour states that if $\mathrm{rw}(G) > k$ then $G$ contains a $\kappa^\mathrm{rk}$-well-linked set of size $k+1$ (Heinrich et al., 9 Jan 2026).

2. Statement of the Main Theorem

Let $t \geq 1$. For every graph $G$ with twin-width $\mathrm{tww}(G) \leq 2$ that is $H_t$-semi-free, the rank-width satisfies

$\mathrm{rw}(G) \leq 22t + 170.$

Consequently, every monadically stable class of twin-width 2 yields a uniformly bounded rank-width (Heinrich et al., 9 Jan 2026). This directly resolves the conjecture proposed by Bergougnoux, Gajarský, Guspiel, Hlinený, Pokrývka, and Sokolowski. The explicit linear bound in $t$ is central for combinatorial and algorithmic applications.

3. Proof Architecture

The proof proceeds by contradiction, assuming a graph $G$ with twin-width $\leq 2$, $H_t$-semi-free, but $\mathrm{rw}(G) > 22t + 170$. Using the Oum–Seymour theorem, there exists a $\kappa^\mathrm{rk}$-well-linked set $W$ of size $11k-5$ for $k=2t+9$, so $11k-5 = 22t+89$.

Given any width-2 contraction sequence $\mathcal{P}_n, ..., \mathcal{P}_1$ for $G$, two pivotal structural lemmas are invoked:

• Existence of a highly connected red 4-path (Lemma 6.4): At some intermediate quotient trigraph, four parts $X_1, X_2, X_3, X_4$ appear forming a red path $X_1$–$_r$–$X_2$–$_r$–$X_3$–$_r$–$X_4$ with no red edge $X_1X_4$, and

$$\kappa^\mathrm{rk}_{G[X_1 \cup X_2 \cup X_3 \cup X_4]}(X_1, X_4) \geq t+6.$$

• Red 4-path implies a half-graph (Lemma 6.5): The presence of such a connected red 4-path with high rank-connectivity ensures $G$ contains a semi-induced $H_t$.

The core of the argument requires careful partition sequence analysis: if rank-width is large but no $H_t$ exists, the properties of the contraction sequence and the well-linked set force the existence of a forbidden half-graph, yielding a contradiction. The explicit steps involve tracking how red-edges evolve during contractions and leveraging subadditivity of rank.

4. Quantitative Bound on Rank-width

For each $t$, the proven structural result is

$\mathrm{rw}(G) \leq 22t + 170,$

with $t$ the parameter of excluded half-graphs. This linear bound in terms of $t$ is a key quantitative advance for the classification of stable graph classes of twin-width 2 and permits parameterized algorithmic conclusions (Heinrich et al., 9 Jan 2026).

5. Algorithmic Implications and Weisfeiler–Leman Procedures

Bounded rank-width plays a direct role in the complexity of the graph isomorphism problem. It is known that for every $k$, the $(3k+4)$-dimensional Weisfeiler–Leman (WL) algorithm correctly decides isomorphism for all graphs of rank-width at most $k$ (Lemma 2.5 in (Heinrich et al., 9 Jan 2026)). Thus, for $H_t$-semi-free graphs with twin-width 2, having $\mathrm{rw}(G) \leq 22t + 170$, the isomorphism problem is solvable algorithmically using the $(3 \cdot (22t+170)+4)$-WL procedure. The implication is that the isomorphism problem on stable twin-width 2 graphs admits a fixed-dimension WL algorithm, and in fact, FP+C-definable canonization.

6. Broader Structural and Logical Significance

The interplay between model-theoretic stability, twin-width, and rank-width highlights the deep connections between logical tameness and combinatorial parameters. Stable twin-width 2 graphs unify notions from first-order model checking, coloring, and isomorphism testing. The boundedness of rank-width enables the import of algorithmic results from the theory of graph decompositions, logical definability (FP+C), and combinatorial optimization into this class. A plausible implication is that further properties of stable twin-width 2 classes—beyond isomorphism and canonization—should be accessible via meta-theorems of bounded rank-width and logical interpretability.

7. Connections and Consequences for Ongoing Research

The result provides a sharp structural foundation for further investigations into the relationship of twin-width with other fundamental invariants, potentially generalizing to higher twin-width under stringent stability or exclusion conditions. The resolution of the Bergougnoux et al. conjecture establishes a key benchmark for classes where low twin-width and logical stability coincide, and it reinforces the program of classifying graph isomorphism complexity in terms of width parameters (Heinrich et al., 9 Jan 2026).