pith. sign in

arxiv: 2507.12973 · v2 · pith:RQCQKEJGnew · submitted 2025-07-17 · 🧮 math.CO · math.GR

A coarse Halin Grid Theorem with applications to quasi-transitive, locally finite graphs

classification 🧮 math.CO math.GR
keywords finitelocallyminorone-endedasymptoticcontainsgraphscoarse
0
0 comments X
read the original abstract

We prove a coarse version of Halin's Grid Theorem: Every one-ended, locally finite graph that contains the disjoint union of infinitely many rays as an asymptotic minor also contains the half-grid as an asymptotic minor. More generally, we show that the same holds for arbitrary (not necessarily one-ended or locally finite) graphs under additional, necessary assumptions on the minor-models of the infinite rays. This resolves a conjecture of Georgakopoulos and Papasoglu. As an application, we show that every one-ended, quasi-transitive, locally finite graph contains the half-grid as an asymptotic minor and as a diverging minor. This in particular includes all locally finite Cayley graphs of one-ended finitely generated groups and solves a problem of Georgakopoulos and Papasoglu.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A coarse Menger's Theorem for planar and bounded genus graphs

    math.CO 2026-05 unverdicted novelty 7.0

    In planar and bounded-genus graphs, absence of k pairwise d-far S-T paths implies a vertex set of size f(d,k) whose d-neighborhood intersects every S-T path.