A full Halin grid theorem
Combinatorics
2024-03-12 v1
Abstract
Halin's well-known grid theorem states that a graph with a thick end must contain a subdivision of the hexagonal half-grid. We obtain the following strengthening when is vertex-transitive and locally finite. Either is quasi-isometric to a tree (and therefore has no thick end), or it contains a subdivision of the full hexagonal grid.
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