Uniqueness of odd-order girth-eight algebraic graphs
Determine whether every graph BΓ3(Fq; f2, f3) with f2,f3∈Fq[p1,l1] and girth at least eight is isomorphic to BΓ3(Fq; p1l1,p1l1^2), and determine whether every graph BΓ2(Fq; f2,f3) with f2∈Fq[p1,l1] and f3∈Fq[p1,l1,p2,l2] and girth at least eight is isomorphic to BΓ2(Fq; p1l1,p1l1^2), for odd prime powers q.
References
Problem 4. (i) Let q be an odd prime power, and let f2, f3 ∈ Fq[p1, l1]. Is it true that every graph BΓ3(Fq; f2, f3) with girth at least eight is isomorphic to the graph BΓ3(Fq; p1l1, p1l2 1)? (ii) Let q be an odd prime power, and let f2 ∈ Fq[p1, l1] and f3 ∈Fq[p1, l1, p2, l2]. Is it true that every graph BΓ2(Fq; f2, f3) with girth at least eight is isomorphic to the graph BΓ2(Fq; p1l1, p1l2 1)?
— Some families of graphs, hypergraphs and digraphs defined by systems of equations
(2503.07915 - Lazebnik et al., 10 Mar 2025) in Problem 4, Section 4.9