Recognizability equals CMSO-definability for graphs of rank-width at most two

Abstract: We prove that, on finite graphs of rank-width at most two, VR-recognizability and counting monadic second-order definability coincide. This advances the recognizability-versus-definability problem from bounded linear clique-width to the first nontrivial bounded rank-width level beyond the rank-width-one split-decomposition case. The proof first treats split-prime graphs. The maximal partial-tree theory of Clark and Whittle organizes the non-sequential cut-rank-two separations, while a single strong separation orients all strong equivalence classes and yields a CMSO-definable laminar family of canonical cores. Although the auxiliary partial tree is not itself transduced, it proves that every canonical local piece has a port-contiguous layout of uniformly bounded linear rank-width. The width argument uses partition atoms and the branch-width-three display theorem of Hall, Oxley, Semple, and Whittle and does not assume that graph torsos remain prime. Coherent ordered rank-two frames then permit a finite-state bottom-up evaluation whose local transitions are definable by the bounded-linear-clique-width theorem of Bojańczyk, Grohe, and Pilipczuk. Finally, the CMSO-transducible canonical split decomposition lifts the result from prime graphs to arbitrary graphs of rank-width at most two.

• The paper establishes that VR-algebra recognizability and CMSO-definability coincide for graphs of rank-width at most two.
• It introduces a multi-level decomposition framework employing split decompositions, canonical cores, and laminar families to manage rank-two connectivity.
• The study leverages finite-state algebraic logic and CMSO-transductions for local evaluations, providing a uniform method for graph property recognition.

Recognizability and CMSO-Definability Coincide for Graphs of Rank-Width at Most Two

Introduction and Theoretical Context

The paper establishes that, for the class $\mathcal{C}_2$ of all finite graphs with rank-width at most two, a graph property is recognizable by the vertex-replacement (VR) algebra if and only if it is definable in counting monadic second-order logic (CMSO$_1$). This resolves the recognizability-versus-definability question for the first nontrivial class beyond rank-width-one, extending results from bounded tree-width and bounded linear clique-width to bounded rank-width two graphs. The result leverages the foundational framework initiated by Courcelle, who showed that CMSO-definability always implies recognizability and asked, for width-restricted classes, whether the converse holds.

For tree-width, the equivalence has been previously established by Bojańczyk and Pilipczuk; for bounded linear clique-width, Bojańczyk, Grohe, and Pilipczuk gave a powerful structural and logical characterization. However, the status for bounded rank-width remained unresolved, especially since rank-width-one graphs (even trees) do not have bounded linear rank-width. Prior work handled rank-width one via split decompositions and CMSO transductions, but the situation for higher rank, and specifically rank-width two, required fundamentally new structural insights.

Methodology and Structural Innovations

Key Decomposition Techniques

The proof employs a multi-level decomposition framework:

• Split Decompositions and Rank-Width: By focusing on split-prime graphs (graphs with no nontrivial splits of cut-rank one), the argument isolates the combinatorial essence of rank-two connectivity.
• Clark-Whittle Partial-Tree Theory: The maximal partial-tree structure of Clark and Whittle is exploited to organize non-sequential cut-rank-two separations, classifying inherently laminar strong equivalence classes of these cuts.
• Canonical Cores and Laminar Families: Each strong equivalence class admits a canonical core—a maximal, non-sequential, absorption-closed subset—which can be oriented and nested to form a laminar set system. These laminar families are shown to be CMSO-definable.

CMSO-Transduction and Congruence Machinery

A pivotal contribution is the construction of a CMSO-transduction that, on input of a split-prime rank-width at most two graph, outputs the strong-core inclusion tree (the laminar decomposition). This enables:

• Construction of local torsos at each node of the laminar tree, replacing "boundary blocks" by port triples, and showing these torsos have uniformly bounded linear rank-width. Flower components (arising from non-sequential cut systems) and flower-free components are handled with separate width arguments.
• Implementation of coherent frame selectors using two unary predicates, ensuring boundary basis consistency across the tree.

The absorption closure, required for non-sequentiality and laminarity, is shown to be CMSO-definable via set-parameterized logic formulas expressing cut-rank conditions and closure under singleton addition.

Finite-State Local Evaluation and Logical Characterization

The local evaluation of a VR-recognizable property proceeds via finite-state transductions along the canonical laminar tree:

• For each local torso, only a finite set of port-configured states are relevant. These states are characterized using the finite-index VR-congruence, lifted to a finite label alphabet encoding port profiles and their CMSO-definable local computation.
• Port-contiguity in the laminar layout is exploited to guarantee uniform upper bounds on linear rank-width of the torsos (at most 6 plus the size of any local representative), enabling application of Bojańczyk-Grohe-Pilipczuk's clique-width definability theorem to each local expansion.
• The main recursion is syntactically realized in CMSO, with the global property reconstructed via local-to-global composition according to the laminar structure.

For arbitrary (not necessarily prime) graphs, the argument is lifted via the canonical split decomposition (Campbell et al.), reducing to the prime case modulo bounded-width clique and star factors. The decomposition is CMSO-transducible, allowing the property-level characterization to be inherited by the global class via finite commutative-monoid calculations on root states across connected components.

Numerical Bounds and Claims

• Linear Rank-Width: Every local torso associated with a node of the canonical strong-core tree has linear rank-width at most six; exceptions involve only a small number of vertices (at most 12), handled via brute-force.
• Bounded-Width Display: The Hall-Oxley-Semple-Whittle display theorem is utilized for flower-free components, showing that compression of boundary blocks yields a 3-connected connectivity function of branch-width three, so that admissible cuts can be decomposed with constant width.

Implications and Future Development Directions

Practical Implications

The result delivers a robust logical characterization for property recognition on graphs of moderate connectivity, subsuming substantial classes such as series-parallel graphs and many tractable dense graph architectures. It provides a uniform method, via CMSO, for expressing any property recognizable by finite-state VR algebra on this class, thus bridging algebraic recognizability and logical definability for a significant fragment of the minor-closed graph universe.

Theoretical Consequences

This study identifies a concrete structural obstacle for extending recognizability-definability equivalence to higher-rank-width classes. At rank two, the manageable combinatorics of flowers and laminar systems allow for a CMSO-definable local decomposition and finite-state evaluation. For higher rank-width, one would require new display theorems or mechanisms ensuring bounded-width local torsos—no such theorems are currently available for, e.g., branch-width four or higher, indicating substantial open ground in combinatorial matroid theory and logic.

The careful separation between auxiliary decomposition (for analysis) and logical definability (for constructive proof) makes the local nature of CMSO-definability explicit and amenable to further automation and extension.

Conclusion

The equivalence between VR-recognizability and CMSO-definability is established for all graphs with rank-width at most two, strictly extending the landscape from tree-width, linear clique-width, and rank-width one. The result leverages the structure theory of non-sequential rank-two cuts, maximal laminar families, and CMSO-definable decompositions, combined with finite-state algebraic logic and precise combinatorial width arguments. This closes the case for rank-width two, delineates the frontier for higher-rank generalization, and provides both a methodologically and structurally transparent logical characterization for graph properties on $\mathcal{C}_2$ (2607.10594).