ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let tt be a positive rational number. The decision problem \scshapeMin−t{\scshape Min-}t-Tough asks whether a graph is minimally tt-tough, meaning that its toughness is at least tt and deleting any edge decreases its toughness below tt.

Min-tt-Tough complexity conjecture. \scshapeMin−t{\scshape Min-}t-Tough is DP-complete for any positive rational number tt.

The paper proves DP-completeness for some positive rational values of tt, while the remaining values are stated to be open; thus the assertion is unresolved in the full stated range.

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.