The algebraic-connectivity conjecture for complete graphs in d\ell_\infty^d

From papers

Let a(G,X)a(G,X) denote the algebraic connectivity of a graph GG in a normed space XX, let K2dK_{2d} be the complete graph on 2d2d vertices, and let TdT_d be the tree defined in the paper. Algebraic-connectivity conjecture.

a(K2d,d)=a(Td)for d4.a(K_{2d},\ell_\infty^d)=a(T_d)\quad\text{for }d\geq 4.

This conjecture compares the algebraic connectivity of the complete graph in the dd-dimensional \ell_\infty space with that of the specified tree TdT_d; the supplied excerpt gives no resolution status.

Progress summary

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

Sources & referencesView supporting material

Primary source

James Cruickshank, Sean Dewar and Derek Kitson, “Algebraic connectivity in normed spaces”, arXiv:2508.00134 (2025).

Solutions 0

No solutions have been posted yet.