ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a digraph, and let k≥2k\geq 2 and ℓ≥2\ell\geq 2 be fixed integers. The parameter κk(D)\kappa_k(D) is the maximum, over all kk-vertex subsets of DD, of the number of internally vertex-disjoint strong subgraphs containing that subset. Sun–Gutin–Yeo–Zhang's conjecture. It is NP-complete to decide, for fixed integers k≥2k\geq 2 and ℓ≥2\ell\geq 2 and a given digraph DD, whether κk(D)≥ℓ\kappa_k(D)\geq \ell. This would extend the established NP-completeness result for the corresponding fixed terminal set parameter κS(D)\kappa_S(D) to κk(D)\kappa_k(D), whose computational complexity is the subject of the conjecture.

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.