2 problems

Continuous-circle greedy-routing conjecture. For every $\varepsilon>0$, there exists a constant $K_0=K_0(\varepsilon)$ such that, for all $K\geq K_0$ and sufficiently large $n$, wi…

Let $\mathcal{F}_1$ and $\mathcal{F}_2$ be two families of graphs with bounded doubling dimension, not necessarily with the same constants. For any two graphs…