About: Halin's grid theorem
An Entity of Type: Abstraction100002137,
from Named Graph: http://dbpedia.org,
within Data Space: dbpedia.org
In graph theory, a branch of mathematics, Halin's grid theorem states that the infinite graphs with thick ends are exactly the graphs containing subdivisions of the hexagonal tiling of the plane. It was published by Rudolf Halin, and is a precursor to the work of Robertson and Seymour linking treewidth to large grid minors, which became an important component of the algorithmic theory of bidimensionality.
