Edge-contraction and subdivision conjecture for graph quasi-isometries

Let G\mathcal{G} be a class of connected graphs closed under contracting edges and subdividing edges. For graphs GG and HH, an (L,C)(L,C)-quasi-isometry has multiplicative distortion LL and additive distortion CC.

Edge-contraction and subdivision conjecture. For all L,CNL,C\in\mathbb{N}, there exists CNC'\in\mathbb{N} such that if a graph GG is (L,C)(L,C)-quasi-isometric to a graph in G\mathcal{G}, then GG is (1,C)(1,C')-quasi-isometric to a graph in G\mathcal{G}.

This is a weakening of the refuted edge-weighting conjecture. It remains open for classes of connected graphs closed under edge contraction and subdivision.

Sources & referencesView supporting material

Primary source

James Davies, Meike Hatzel and Robert Hickingbotham, “Quasi-isometries between graphs with variable edge lengths”, arXiv:2503.07448 (2025).

Additional references

2 papers in this index state this conjecture (2021–2025). The statement above is taken from the most recent of them; the others are arXiv:2103.02307.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.