1 paper · 1 filter
Christopher H. Cashen, Pallavi Dani, Kevin Schreve +1
We introduce a graph-theoretic condition, called (n,m)--branching, that ensures a combinatorial round tree with controlled branching parameters can be quasi-isometrically embedde…