AMRZ conjecture on graph lines and universal pairs

Let G=(V,E)G=(V,E) be a connected graph with at least two vertices. Let (G)\ell(G) be the number of distinct graph-metric lines, and let a universal pair be a pair of vertices generating a line equal to VV; write \textscup(G)\textsc{up}(G) for the number of universal pairs. AMRZ's conjecture.

(G)+\textscup(G)V.\ell(G)+\textsc{up}(G)\geq |V|.

The paper proves this inequality for metric spaces whose distances lie in {0,1,2}\{0,1,2\}, while the stated conjecture for connected graphs in general remains open.

Sources & referencesView supporting material

Primary source

Martín Matamala and José Zamora, “Lines in metric spaces: universal lines counted with multiplicity”, arXiv:1803.07154 (2018).

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.