ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let V(G)V(G) be its vertex set, and let f(G)f(G) denote the exact minimum size of a vertex-separating tree system of GG. Threshold-complexity conjecture. Determining whether

f(G)=ciellog⁡∣V(G)∣⌉f(G)=ciel\log{|V(G)|}\rceil

for a given graph GG is NP-complete.

This is a more specific decision problem than computing the exact value of f(G)f(G). 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 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.