The induced-subgraph counting hardness conjecture
Statement
Let be a computable graph property. For a graph and positive integer , let denote the problem of counting the -vertex subsets of that induce a graph satisfying , parameterized by . Suppose that there are infinitely many positive integers such that is neither true nor false on all graphs with vertices.
Induced-subgraph counting hardness conjecture. Then is -hard.
This conjecture proposes an explicit criterion for the -hardness of induced-subgraph counting problems. The known dichotomy gives that every such problem is either fixed-parameter tractable or -hard, while the conjecture aims to characterize the hard cases; its status is not resolved in the supplied source.
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.