Dot-product realisation conjecture for locally completable graphs
Dot-product realisation conjecture for locally completable graphs
Let be a semisimple graph with that is locally completable in . Let be the dot-product measurement map in dimension , and let be finite.
Dot-product realisation conjecture. One has
and this bound is tight.
The source says that a similar approach might provide a full solution, so the statement remains prospective and open.
Sources & referencesView supporting material
Primary source
Sean Dewar, Nora Frankl, Samuel Mansfield, Anthony Nixon, Jonathan Passant and Audie Warren, “Generalised Erdős distance theory on graphs”, arXiv:2505.06590 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.