3 problems

A graph is strictly metrizable if every pair of vertices has a unique shortest path under some positive edge weighting. The forbidden-minor conjecture. A graph is strictly metrizab…

A graph $G$ is $(\lambda,\mu)$-bow metric if, whenever shortest paths $P(u,w)$ and $P(v,x)$ share a common shortest subpath $P(v,w)$ of length more than $\lambda$, one has … A grap…

Let $G$ be a graph of polynomial growth, with growth rate $\rho(G)$, and let $\mathsf{emb}(G)$ be the least dimension $d$ such that $G$ embeds into the grid with diagonals…