An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
Ken‐ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer · 2014
The excluded grid theorem, originally proved by Robertson and Seymour in Graph Minors V, 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 as the basis for bidimensionality theory on graph classes excluding a fixed minor.