Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs

In this note we disprove the uniform shortest path routing conjecture for vertex-transitive graphs by constructing an infinite family of counterexamples