Nguyen–Scott–Seymour edge-weighting conjecture for graph quasi-isometries
Statement
For , let and be graphs and let be an -quasi-isometry from to . An edge-weighting function gives the weighted-graph metric, denoted .
Nguyen–Scott–Seymour conjecture. For all , there exists such that if is an -quasi-isometry from a graph to a graph , then there is an edge-weighting function such that the same function is a -quasi-isometry from to the weighted graph .
The conjecture asserts that suitable positive integer edge weights can remove multiplicative distortion while retaining only bounded additive distortion. The paper proves that this general formulation is false by constructing counterexamples, so it is refuted.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.