The directed grid theorem
From MaRDI portal
Publication:2941561
DOI10.1145/2746539.2746586zbMATH Open1321.05249arXiv1411.5681OpenAlexW2037750191MaRDI QIDQ2941561FDOQ2941561
Authors: Ken-ichi Kawarabayashi, Stephan Kreutzer 
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1411.5681
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
Directed graphs (digraphs), tournaments (05C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph minors (05C83)
Cites Work
- Shortest-path queries in static networks
- Approximate distance oracles
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On approximate distance labels and routing schemes with affine stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Approximate distance oracles with constant query time
- Fast C-K-R partitions of sparse graphs
- Automata, Languages and Programming
- Ramsey partitions and proximity data structures
Cited In (28)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps.
- Directed path-decompositions
- Excluding a planar matching minor in bipartite graphs
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- Half-integral linkages in highly connected directed graphs
- \(k\)-distinct in- and out-branchings in digraphs
- Packing \(A\)-paths of length zero modulo four
- Polynomial planar directed grid theorem
- Complete directed minors and chromatic number
- Constant congestion routing of symmetric demands in planar directed graphs
- Detours in directed graphs
- Planar Digraphs
- Euler digraphs
- Constant congestion brambles in directed graphs
- Adapting the directed grid theorem into an FPT algorithm
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Classes of intersection digraphs with good algorithmic properties
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- Cut-sufficient directed 2-commodity multiflow topologies
- Even circuits in oriented matroids
- Finding detours is fixed-parameter tractable
- Towards the graph minor theorems for directed graphs
- Title not available (Why is that?)
- An excluded grid theorem for digraphs with forbidden minors
- Digraphs of bounded width
- Directed ear anonymity
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
Uses Software
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)
