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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。