NP-completeness of recognizing graphs with minimum separating number
Statement
Let be a graph, let be its vertex set, and let denote the exact minimum size of a vertex-separating tree system of . Threshold-complexity conjecture. Determining whether
for a given graph is NP-complete.
This is a more specific decision problem than computing the exact value of . The supplied text gives no evidence that this conjecture has been resolved, so it 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.