ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD and D′D' be digraphs. For a digraph GG, let iDi_D (respectively, iD′i'_D) denote the corresponding induced-subdivision detection problem. Say that DD is an induced subdigraph of D′D' if D′D' contains a vertex-induced copy of DD.

Monotonicity conjecture. If iDi_D (respectively, iD′i'_D) is NP-complete, then for every digraph D′D' containing DD as an induced subdigraph, iD′i_{D'} (respectively, iD′′i'_{D'}) is NP-complete.

The conjecture is proposed as a tool for proving a full complexity dichotomy. It covers both variants discussed in the paper and is open according to the surrounding remarks.

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.