The directed grid theorem
From MaRDI portal
Publication:2941561
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
(28)- Detours in directed graphs
- Digraphs of bounded width
- Planar Digraphs
- Directed path-decompositions
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- Constant congestion brambles in directed graphs
- Directed ear anonymity
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps.
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Classes of intersection digraphs with good algorithmic properties
- Half-integral linkages in highly connected directed graphs
- Excluding a planar matching minor in bipartite graphs
- scientific article; zbMATH DE number 7525509 (Why is no real title available?)
- Even circuits in oriented matroids
- Cut-sufficient directed 2-commodity multiflow topologies
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
- Finding detours is fixed-parameter tractable
- Packing \(A\)-paths of length zero modulo four
- \(k\)-distinct in- and out-branchings in digraphs
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Towards the graph minor theorems for directed graphs
- Adapting the directed grid theorem into an FPT algorithm
- Constant congestion routing of symmetric demands in planar directed graphs
- Complete directed minors and chromatic number
- An excluded grid theorem for digraphs with forbidden minors
- Euler digraphs
- Polynomial planar directed grid theorem
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)
