ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix a positive integer rr. The rthr^{th} Stable Divisorial Gonality problem asks whether a graph has stable divisorial gonality at most a given integer. Stable divisorial gonality conjecture. The rthr^{th} Stable Divisorial Gonality problem is NP-complete. NP-hardness is established in the paper, while membership in NP is known for r=1r=1 but remains open for general rr.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.