Lazebnik–Ustimenko–Woldar's diameter upper-bound conjecture

About 1 year old · traced to

Let C ⁣D(k,q)C\!D(k,q) be a connected component of D(k,q)D(k,q), with k≥2k\ge 2 and qq a prime power. Lazebnik–Ustimenko–Woldar's conjecture. There is a positive constant CC such that

diam⁡(C ⁣D(k,q))≤(log⁡q−1q)k+C.\operatorname{diam}(C\!D(k,q))\le (\log_{q-1}q)k+C.

This predicts a linear diameter bound with coefficient log⁡q−1q\log_{q-1}q; the source gives no resolution.

References

Primary source

Felix Lazebnik and Ye Wang, “Some families of graphs, hypergraphs and digraphs defined by systems of equations”, arXiv:2503.07915 (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.