3 problems
Matching
Let and be finite graphs that are -roughly isometric, and suppose both have maximal degree at most . Denote by and the…
Let and be isotropic trees. Let denote the associated set of obstructions to a rough isometric e…
Rough-isometry invariance conjecture. There is a constant such that