The directed grid theorem
From MaRDI portal
Abstract: The grid theorem, originally proved by Robertson and Seymour in Graph Minors V in 1986, is one of the most central results in the study of graph minors. It has found numerous applications in algorithmic graph structure theory, for instance in bidimensionality theory, and it is the basis for several other structure theorems developed in the graph minors project. In the mid-90s, Reed and Johnson, Robertson, Seymour and Thomas (see [Reed 97, Johnson, Robertson, Seymour, Thomas 01]), independently, conjectured an analogous theorem for directed graphs, i.e. the existence of a function f : N -> N such that every digraph of directed tree-width at least f(k) contains a directed grid of order k. In an unpublished manuscript from 2001, Johnson, Robertson, Seymour and Thomas give a proof of this conjecture for planar digraphs. But for over a decade, this was the most general case proved for the Reed, Johnson, Robertson, Seymour and Thomas conjecture. Only very recently, this result has been extended to all classes of digraphs excluding a fixed undirected graph as a minor (see [Kawarabayashi, Kreutzer 14]). In this paper, nearly two decades after the conjecture was made, we are finally able to confirm the Reed, Johnson, Robertson, Seymour and Thomas conjecture in full generality and to prove the directed grid theorem. As consequence of our results we are able to improve results in Reed et al. in 1996 [Reed, Robertson, Seymour, Thomas 96] (see also [Open Problem Garden]) on disjoint cycles of length at least l and in [Kawarabayashi, Kobayashi, Kreutzer 14] on quarter-integral disjoint paths. We expect many more algorithmic results to follow from the grid theorem.
Recommendations
- An excluded grid theorem for digraphs with forbidden minors
- Towards the graph minor theorems for directed graphs
- Polynomial planar directed grid theorem
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- Adapting the directed grid theorem into an FPT algorithm
Cites work
- Approximate distance oracles
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Fast C-K-R partitions of sparse graphs
- Near-Linear Time Construction of Sparse Neighborhood Covers
- On approximate distance labels and routing schemes with affine stretch
- On sparse spanners of weighted graphs
- Ramsey partitions and proximity data structures
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- Shortest-path queries in static networks
Cited in
(43)- k-distinct in- and out-branchings in digraphs
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- Packing \(A\)-paths of length zero modulo four
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Euler digraphs
- Planar Digraphs
- Digraphs of bounded width
- Towards the graph minor theorems for directed graphs
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Constant congestion routing of symmetric demands in planar directed graphs
- Finding detours is fixed-parameter tractable
- Even circuits in oriented matroids
- Constant congestion brambles in directed graphs
- Packing directed circuits quarter-integrally
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps.
- Adapting the directed grid theorem into an FPT algorithm
- Half-integral linkages in highly connected directed graphs
- Directed path-decompositions
- Polynomial planar directed grid theorem
- An excluded grid theorem for digraphs with forbidden minors
- Complete directed minors and chromatic number
- Cut-sufficient directed 2-commodity multiflow topologies
- Detours in directed graphs
- Excluding a planar matching minor in bipartite graphs
- Classes of intersection digraphs with good algorithmic properties
- Directed ear anonymity
- Hitting long directed cycles is fixed-parameter tractable
- On digraphs without onion star immersions
- Delineating half-integrality of the Erdős-Pósa property for minors: the case of surfaces
- Constant congestion linkages in polynomially strong digraphs in polynomial time
- New Menger-like dualities in digraphs and applications to half-integral linkages
- A grid theorem for strong immersions of walls
- Polynomial kernel for immersion hitting in tournaments
- Packing directed cycles quarter- and half-integrally
- A half-integral Erdős-Pósa theorem for directed odd cycles
- Cut-sufficient directed 2-commodity multiflow topologies
- Constant approximating disjoint paths on acyclic digraphs is W[1]-hard
- Hitting cycles through prescribed vertices or edges
- An overview of universal obstructions for graph parameters
- A star-comb lemma for finite digraphs
- Revisiting directed disjoint paths on tournaments (and relatives)
This page was built for publication: The directed grid theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941561)
