Asymptotic structure. II. Path-width and additive quasi-isometry
Abstract
We show that if a graph G admits a quasi-isometry φ to a graph H of bounded path-width, then we can assign a non-negative integer length to each edge of H, such that the same function φ is a quasi-isometry to this weighted version of H, with error only an additive constant.
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.