ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FF be a fixed strict digraph. An FF-subdivision is a digraph obtained from FF by replacing each arc abab with a directed (a,b)(a,b)-path; the associated problem asks whether an input digraph DD contains an FF-subdivision as a subdigraph. Bang-Jensen et al.'s dichotomy conjecture. For every digraph FF, the FF-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 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.