ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a digraph. For a digraph GG, let iDi_D denote the problem of deciding whether GG contains an induced subdivision of DD. A spider is a tree obtained from disjoint directed paths by identifying one end of each path into a vertex, and C2C_2 is the digraph on two vertices with both possible arcs.

Induced-subdivision dichotomy conjecture. iDi_D is NP-complete unless DD is the disjoint union of spiders and at most one 22-cycle.

This conjecture proposes the complexity dichotomy for induced-subdivision detection in digraphs; the preceding results establish the analogous statement for oriented graphs, while the general digraph case 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.