The induced-subdivision dichotomy conjecture for digraphs
Statement
Let be a digraph. For a digraph , let denote the problem of deciding whether contains an induced subdivision of . A spider is a tree obtained from disjoint directed paths by identifying one end of each path into a vertex, and is the digraph on two vertices with both possible arcs.
Induced-subdivision dichotomy conjecture. is NP-complete unless is the disjoint union of spiders and at most one -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.