Halin's grid theorem
In the mathematics of infinite graphs, 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 in 1965. It is a precursor to the work of Neil Robertson and Paul Seymour linking treewidth to large grid minors in finite graphs, which became an important component of the algorithmic theory of bidimensionality.