Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO

TL;DR

This paper characterizes classes of graphs with bounded shrub-depth via forbidden induced subgraphs and explores the expressive power of MSO logic compared to FO logic within these classes, answering longstanding open questions.

Contribution

It provides a forbidden subgraph characterization of bounded shrub-depth classes and fully characterizes when FO and MSO have the same expressive power on hereditary graph classes.

Findings

Hereditary classes of unbounded shrub-depth interpret all paths.

MSO is more expressive than FO on classes of unbounded shrub-depth.

Bounded shrub-depth classes are characterized by specific forbidden induced subgraphs.

Abstract

The graph parameter shrub-depth is a dense analog of tree-depth. We characterize classes of bounded shrub-depth by forbidden induced subgraphs. The obstructions are well-controlled flips of large half-graphs and of disjoint unions of many long paths. Applying this characterization, we show that on every hereditary class of unbounded shrub-depth, MSO is more expressive than FO. This confirms a conjecture of [Gajarsk\'y and Hlin\v{e}n\'y; LMCS 2015] who proved that on classes of bounded shrub-depth FO and MSO have the same expressive power. Combined, the two results fully characterize the hereditary classes on which FO and MSO coincide, answering an open question by [Elberfeld, Grohe, and Tantau; LICS 2012]. Our work is inspired by the notion of stability from model theory. A graph class C is MSO-stable, if no MSO-formula can define arbitrarily long linear orders in graphs from C. We show that a hereditary graph class is MSO-stable if and only if it has bounded shrub-depth. As a key ingredient, we prove that every hereditary class of unbounded shrub-depth FO-interprets the class of all paths. This improves upon a result of [Ossona de Mendez, Pilipczuk, and Siebertz; Eur. J. Comb. 2025] who showed the same statement for FO-transductions instead of FO-interpretations.