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

From papers

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 q4q\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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Felix Lazebnik and Ye Wang, “Some families of graphs, hypergraphs and digraphs defined by systems of equations”, arXiv:2503.07915 (2025).

Solutions 0

No solutions have been posted yet.