9 problems
Let be the algebraically defined graph introduced in the paper, and let its second largest eigenvalue mean the second largest eigenvalue of its adjacency matrix. Nearly Ra…
Let be a connected component of , and let denote its second largest eigenvalue. Ustimenko's conjecture. For all and , … This is a universal s…
Let be a connected component of . Schneider's conjecture. For every prime power , . For odd, the diameter is , a…
Let be a connected component of , with and a prime power. Lazebnik–Ustimenko–Woldar's conjecture. There is a positive constant such that … This…
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 s…
Let be an irreducible affine hypersurface in . It is -grid-free when the associated bipartite algebraic graph contains no complete bipart…
Let be an irreducible hypersurface in , and let be nonempty Zariski-open subsets of . A hypersurface restriction is -…
Let be an irreducible hypersurface in . A set is almost--grid-free if there are nonempty Zariski…
Let and let be an arbitrary field. The graph has rooted-tree components, and a maximal infinite path is an infinite path starting at the ro…