Baker's subdivision and metric-graph gonality conjecture
Statement
Let be a connected loopless multigraph, let be the corresponding metric graph with unit edge lengths, and let . For each integer , let denote the multigraph obtained by subdividing every edge of into parts. Baker's gonality conjecture. Then:
(a)
for all ; and
(b)
This was posed as the second remaining conjecture in Baker's work on divisors on graphs. The paper's abstract states that it settles this conjecture in the negative by exhibiting graphs whose metric divisorial gonality is strictly smaller than their discrete divisorial gonality, so the conjecture is refuted.
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.