A full Halin grid theorem

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…