[Paper Review] On first-order transductions of classes of graphs

Samuel Braunfeld, Jaroslav Nešetřil+2 more|arXiv (Cornell University)|Aug 30, 2022

semigroups and automata theory4 citations

TL;DR

This paper investigates the first-order (FO) transduction quasi-order on hereditary classes of graphs, establishing that it is highly complex—neither a lattice nor a distributive lattice—yet forms a bounded distributive join-semilattice. It characterizes transductions of paths, cubic graphs, and trees via structural parameters like bandwidth, treewidth, and degree, and proves that pathwidth classes form a strict hierarchy under FO transduction, while identifying star forests as the minimal non-bounded-degree transduction class, revealing a transduction duality.

ABSTRACT

We study various aspects of the first-order transduction quasi-order on graph classes, which provides a way of measuring the relative complexity of graph classes based on whether one can encode the other using a formula of first-order (FO) logic. In contrast with the conjectured simplicity of the transduction quasi-order for monadic second-order logic, the FO-transduction quasi-order is very complex, and many standard properties from structural graph theory and model theory naturally appear in it. We prove a local normal form for transductions among other general results and constructions, which we illustrate via several examples and via the characterizations of the transductions of some simple classes. We then turn to various aspects of the quasi-order, including the (non-)existence of minimum and maximum classes for certain properties, the strictness of the pathwidth hierarchy, the fact that the quasi-order is not a lattice, and the role of weakly sparse classes in the quasi-order.

Motivation & Objective

• To analyze the structure of the first-order transduction quasi-order on hereditary graph classes, which measures logical complexity via definable encodings.
• To characterize transductions of fundamental graph classes—such as paths, cubic graphs, and trees—using structural graph parameters like bandwidth, treewidth, and degree.
• To investigate whether properties like bounded pathwidth or treewidth form strict hierarchies under FO transduction.
• To explore the existence of maximum or minimum classes in the transduction quasi-order, particularly identifying minimal classes not transducible from bounded-degree graphs.
• To propose and examine conjectures on dense analogues of sparse classes, especially relating monadic stability and sparsifiability.

Proposed method

• Introduces a normal form for FO-transductions that captures the locality inherent in first-order logic, enabling structural analysis.
• Uses transduction subsumption and gluing techniques to build complex transductions from simpler components.
• Applies model-theoretic concepts like monadic dependence and stability to characterize transduction-closed classes.
• Employs structural graph theory tools—such as treewidth, pathwidth, and degeneracy—to classify transduction relationships.
• Develops the notion of 'dense analogues' of sparse classes to extend sparsity theory beyond monotone classes.
• Leverages results from structural sparsity (e.g., bounded expansion, nowhere denseness) and transduction duality to derive implications.

Experimental results

Research questions

• RQ1 Does the first-order transduction quasi-order on hereditary graph classes form a lattice, or is it more complex?
• RQ2 Do classes of graphs with pathwidth at most k form a strict hierarchy under FO transduction for k ≥ 1?
• RQ3 Is there a minimal class not transducible from any bounded-degree graph class, and what is its structural characterization?
• RQ4 Can monadically stable classes be sparsified, i.e., transduction-equivalent to weakly sparse classes?
• RQ5 What is the relationship between dense analogues of bounded expansion classes and monadic stability in the transduction quasi-order?

Key findings

• The first-order transduction quasi-order on hereditary graph classes is not a lattice, nor is its quotient partial order, indicating high complexity.
• Classes of graphs with pathwidth at most k form a strict hierarchy under FO transduction for all k ≥ 1.
• Star forests are the minimal class that is not a transduction of any bounded-degree graph class, demonstrating a form of transduction duality.
• Transductions of paths, cubic graphs, and cubic trees are characterized by bounded bandwidth, bounded degree, and bounded treewidth, respectively.
• The transduction quasi-order forms a bounded distributive join-semilattice, and so does the subposet of additive classes.
• Conjectures suggest that monadically stable classes are sparsifiable if and only if their dense analogues are fully captured by transduction downsets of bounded expansion classes.