Devriendt–Ottolini–Steinerberger minimum constant resistance curvature conjecture

Let GG be a connected graph on n3n\geq 3 vertices. For each vertex viv_i, let κi\kappa_i be its resistance curvature, defined by the unique solution κ\kappa of

RGκ=1,R_G\kappa=\mathbf{1},

where RGR_G is the resistance matrix and 1\mathbf{1} is the all-one vector. If all vertices have the same resistance curvature, write the common value as KG\mathcal{K}_G. Devriendt–Ottolini–Steinerberger's conjecture.

KG6n21,\mathcal{K}_G\geq\frac{6}{n^2-1},

with equality if and only if G=CnG=C_n. This conjecture gives the expected sharp lower bound for constant resistance curvature, improving the previously known bound KG1/(n(n1))\mathcal{K}_G\geq 1/(n(n-1)); the supplied text does not establish whether the conjecture itself is resolved.

Sources & referencesView supporting material

Primary source

Wensheng Sun, Yujun Yang and Shou-Jun Xu, “On the minimum constant resistance curvature conjecture of graphs”, arXiv:2504.20448 (2025).

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.