NP-completeness conjecture for stable divisorial gonality
Statement
Fix a positive integer . The Stable Divisorial Gonality problem asks whether a graph has stable divisorial gonality at most a given integer. Stable divisorial gonality conjecture. The Stable Divisorial Gonality problem is NP-complete. NP-hardness is established in the paper, while membership in NP is known for but remains open for general .
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.