Minors of plane digraphs

Abstract: A digraph $H$ is a semi-strong minor'' of another, $G$, if a subdivision of $H$ can be obtained from a subdigraph of $G$ by contracting strongly-connected subdigraphs to single vertices. We will define a width measure ofplane'' digraphs (that is, drawn in the plane) based on a kind of branch-composition, and show that for every plane digraph $H$, all plane digraphs not containing $H$ as a semi-strong minor have bounded width, while plane digraphs in general have unbounded width.

• The paper presents a structural theorem proving that excluding a fixed planar digraph as a semi-strong minor bounds its dart-width.
• It introduces novel concepts such as semi-strong minors and diwalls, generalizing undirected minor theory to directed planar graphs.
• The approach leverages decomposition techniques and carving methods to derive polynomial bounds on width parameters.

Semi-Strong Minors and Width Measures in Plane Digraphs

Introduction

The paper "Minors of plane digraphs" (2604.00833) by Chudnovsky and Seymour addresses the extension of the graph minors theory—especially structural analogues of the Robertson-Seymour Theorem in the planar setting—to the context of directed graphs (digraphs) drawn in the plane. This work formulates and proves a strong structural theorem regarding the exclusion of digraph minors, based on a new minor notion tailored for digraphs (semi-strong minors) and a specialized width parameter (dart-width) adapted for planar embeddings. The results subsume classical excluded minor theorems for undirected planar graphs and situate their digraph analogues among other important parameters like branch-width and tree-width.

Semi-Strong Minors, diwalls, and Width Parameters

Minor Operations and Directed Grids

The authors introduce the notion of semi-strong minors: a digraph $H$ is a semi-strong minor of $G$ if some directed subdivision of $H$ arises from $G$ through contractions of strongly connected subdigraphs (following the strong contraction paradigm). They compare this to butterfly and strong minors, emphasizing that, uniquely, every planar digraph is a semi-strong minor of a sufficiently large alternating grid-like object called a diwall. These "diwalls" are planar digraphs generalizing undirected grids, embodying alternating patterns in their orientation, and play the role of “universal obstructions” for planar digraphs under this minor relation.

To generalize tree-width and branch-width for digraphs in the plane, the authors construct the diwidth and dart-width parameters:

• diwidth: For plane digraphs with bounded edge “interleaving” at vertices (edges incident to a vertex partition into intervals of consistently directed arcs), this parameter, built from carving decompositions, mimics the role of branch-width but measures "change numbers" (switches between incoming/outgoing edges) across cuts.
• dart-width: This parameter extends diwidth to general planar digraphs (without interleaving bounds), carving on sets of darts (vertex, edge pairs), with cuts measured by a sum of change numbers on boundaries and vertex intersections.

Main Structural Theorems

Excluded diwall Theorem

The central result states that for every fixed plane digraph $H$, there exists a constant $k$ such that any plane digraph excluding $H$ as a semi-strong minor must have bounded dart-width; conversely, plane digraphs excluding a fixed diwall exhibit bounded width—fully paralleling the Robertson-Seymour structure theorem for undirected planar minors:

• Formal statement: For each even $k\geq2$, every weakly 2-edge-connected, loopless plane digraph not embedding a $k \times k$ diwall has dart-width $O(k^2)$.
• Numerical bounds: The main theorem gives explicit polynomial bounds: for even $G$0, the dart-width is bounded by $G$1 if the $G$2 diwall is excluded.

This immediately yields a well-quasi-ordering-style conclusion: For the class of planar digraphs under semi-strong minors, any minor-closed class can be characterized by bounded width.

Furthermore, the results consistently recover (in the undirected case) the classical correspondence between grid minors and tree-/branch-width.

Technical Innovations

The approach involves several advanced structural combinatorics tools:

• Alternating ring constructions: Controlled arrangements of directed cycles are used to analyze and produce well-structured layouts akin to grid-like embeddings.
• Decomposition theorems via carvings: Adaptation of carving-width and bond-based decompositions to directed settings, quantifying complexity by change numbers and intervals determined by planar embeddings.
• Duality and regions: Intricate use of planar duals, regions, and circular orderings around vertices to localize cut complexity.
• Inductive proofs with intricate cut/cover arguments: Proofs employ induction on edge contractions and decompositions, leveraging "minimal cut" principles, and combining local path and global ring structure arguments.

Comparison to Other Digraph Minor Theorems

The results here are juxtaposed with directed grid theorems, specifically the Kawarabayashi-Kreutzer theorem addressing butterfly minors and directed tree-width [kawa1; kawa2]. The authors highlight both strengths and limits:

• Strengths: The semi-strong minor is more general regarding which planar digraph minors are excluded, as any planar digraph is a semi-strong minor of a large enough diwall (unlike for butterfly minors).
• Limits: The main theorems only establish the structure for digraphs drawn in the plane; they do not extend to arbitrary digraphs as in the reciprocal result for directed tree-width and butterfly minors.
• Methodological Tie: The decomposition depends on the planar embedding, with the width parameter intrinsically tied to planar geometry (intervals of edges, region boundaries).

Practical and Theoretical Implications

The established structural theorem yields several consequences:

• Any property defined by excluding a finite set of planar digraphs as semi-strong minors is characterized by bounded dart-width, providing a robust form of structure theory for planar digraphs.
• The techniques facilitate polynomial-time algorithms for many decompositional parameters in planar digraphs, echoing computational tractability results for branch-width and carving-width in the undirected setting.
• The work clarifies the relationship among minor orderings in digraphs (butterfly, strong, semi-strong) and delineates classes (circular, normal digraphs) where equivalent width parameters characterize minor-closed properties.

The most significant theoretical implication is a concrete, constructive bridge between minor theory for undirected planar graphs and the much more delicate landscape of digraph minors and width, motivating further investigation into more general surfaces and broader classes of minors.

Conclusion

The paper provides a comprehensive, technical extension of the Robertson-Seymour planar graph minors theory to directed graphs in the plane using the novel notions of semi-strong minors, diwalls, and dart-width. The theorems establish polynomially bounded decompositions whenever a fixed planar digraph is excluded as a semi-strong minor, elucidating the structure of planar digraphs with compelling analogues to undirected theory, and situating their results among parameterized digraph minor theorems. This advances understanding of how “minor-exclusion” phenomena manifest in planar digraphs and underlines the interplay between embedding, directionality, and combinatorial width.