Dot-product realisation conjecture for locally completable graphs

About 1 year old · traced to

Let G=(V,E)G=(V,E) be a semisimple graph with ∣V∣≥4|V|\geq4 that is locally completable in R3\mathbb R^3. Let gg be the dot-product measurement map in dimension 33, and let P⊂R3P\subset\mathbb R^3 be finite.

Dot-product realisation conjecture. One has

∣fg,G(PV)∣≫∣P∣∣V∣−1,\left|f_{g,G}\left(P^V\right)\right|\gg |P|^{|V|-1},

and this bound is tight.

The source says that a similar approach might provide a full solution, so the statement remains prospective and open.

References

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

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.