Lazebnik–Ustimenko–Woldar's girth conjecture for Wenger-type graphs

About 1 year old · traced to

Let D(k,q)D(k,q) be the graph defined by the parameters kk and the prime power qq. Lazebnik–Ustimenko–Woldar's conjecture. For every prime power q≥4q\ge 4, the graph has girth

girth⁡(D(k,q))={k+5,k odd,k+4,k even.\operatorname{girth}(D(k,q))= \begin{cases} k+5, & k\text{ odd},\\ k+4, & k\text{ even}. \end{cases}

The source records matching lower bounds and presents equality as conjectural; no general resolution is supplied.

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.