English

A full Halin grid theorem

Combinatorics 2024-03-12 v1

Abstract

Halin's well-known grid theorem states that a graph GG with a thick end must contain a subdivision of the hexagonal half-grid. We obtain the following strengthening when GG is vertex-transitive and locally finite. Either GG is quasi-isometric to a tree (and therefore has no thick end), or it contains a subdivision of the full hexagonal grid.

Keywords

Cite

@article{arxiv.2403.05862,
  title  = {A full Halin grid theorem},
  author = {Agelos Georgakopoulos and Matthias Hamann},
  journal= {arXiv preprint arXiv:2403.05862},
  year   = {2024}
}

Comments

12 pages

R2 v1 2026-06-28T15:14:26.158Z