Bounded multiplicity conjecture for Jacobians of biconnected graphs
Statement
Let be a positive integer, and let be an integer depending on . A graph is biconnected if it has the connectivity property intended in the paper. Bounded multiplicity conjecture. For any positive integer , there exists such that, whenever , there is no biconnected graph satisfying
The conjecture is motivated by the observation that random graphs are highly connected and that Jacobians of most graphs appear to have few invariant factors. The supplied text gives no resolution, so the conjecture remains open.
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.