Induced subgraph isomorphism hardness conjecture for bipartite permutation graphs
Statement
Let be a hereditary subclass of bipartite permutation graphs. The induced subgraph isomorphism problem asks whether an input graph occurs as an induced subgraph of another input graph.
Induced subgraph isomorphism hardness conjecture. Unless , the induced subgraph isomorphism problem is NP-hard in if and only if contains all linear forests. Equivalently, for every fixed , the problem can be solved in polynomial time for -free bipartite permutation graphs.
The conjecture would characterize the hereditary subclasses of bipartite permutation graphs on which induced subgraph isomorphism is NP-hard, with linear forests as the unique minimal hard class.
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.