Lazebnik–Ustimenko–Woldar's girth conjecture for Wenger-type graphs
Lazebnik–Ustimenko–Woldar's girth conjecture for Wenger-type graphs
From papers
Let be the graph defined by the parameters and the prime power . Lazebnik–Ustimenko–Woldar's conjecture. For every prime power , the graph has girth
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
Sign in to submit a solution.
No solutions have been posted yet.