Bang-Jensen et al.'s subdivision-problem dichotomy conjecture
Statement
Let be a fixed strict digraph. An -subdivision is a digraph obtained from by replacing each arc with a directed -path; the associated problem asks whether an input digraph contains an -subdivision as a subdigraph. Bang-Jensen et al.'s dichotomy conjecture. For every digraph , the -subdivision problem is polynomial-time solvable or NP-complete. This conjecture concerns the algorithmic classification of fixed-digraph subdivision problems; the paper gives further support to it and, for digraphs of order four, classifies all but five exceptions.
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.