Non-generality conjecture for sufficiently large maximally symmetric trivalent graphs
Statement
Let be a trivalent maximally symmetric graph or multigraph of genus ; multigraphs may have loops or may be loopless. A graph is Brill–Noether general if, for every pair of positive integers and such that
is negative, it has no effective divisor of degree and rank at least . The non-generality conjecture. If is sufficiently large, then is not Brill–Noether general. This conjecture is motivated by the explicit counterexamples for maximally symmetric trivalent graphs, loopless multigraphs, and simple graphs established in the paper; the exact threshold for the general class is not stated in the supplied text.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.