ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let SS be a 33-subset of V(G)V(G), and let n=∣V(G)∣n=|V(G)|. For a set SS, write ckappa(S)ckappa(S) for the maximum number of internally disjoint trees connecting SS.

Li's conjecture. Given GG, SS, and an integer cellcell with 2≤cell≤n−22\leq cell\leq n-2, deciding whether

ckappa(S)≥cellckappa(S)\geq cell

is an NP\mathcal{N}\mathcal{P}-complete problem.

The conjecture concerns the unresolved case k=3k=3 of the complexity of deciding whether a prescribed set can be connected by many internally disjoint trees. The corresponding problem is polynomial-time solvable when both kk and cellcell are fixed, while it is known to be NP\mathcal{N}\mathcal{P}-complete for fixed k≥4k\geq 4; the k=3k=3 case remains open in the source.

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.