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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.