Papers
Topics
Authors
Recent
Search
2000 character limit reached

A full Halin grid theorem

Published 9 Mar 2024 in math.CO | (2403.05862v1)

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

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.